# Advanced Data Structures & Algorithms in Java: Solving Binary Tree Problems

Java    |    Intermediate
• 18 videos | 1h 24m 57s
• Includes Assessment
Rating 4.3 of 12 users (12)
Binary trees are commonly used data structures in programming interviews. It's essential you know how to solve binary tree problems such as counting the number of nodes in a tree, finding the maximum depth of a tree, and mirroring a binary tree using robust, recursive solutions. In this course, you'll solve some common interview-style problems using binary trees, such as how to use a recursive algorithm to count the number of nodes in a binary tree, calculate the maximum depth of a tree, sum up the values of nodes along a path, and mirror a binary tree. Finally, you'll explore different kinds of binary trees, namely the full binary tree, the complete binary tree, the perfect binary tree, and the balanced binary tree.

## WHAT YOU WILL LEARN

• Discover the key concepts covered in this course
Recognize how the recursive algorithm to count nodes works
Write code to implement the count nodes algorithm
Recognize how the maximum depth of a binary tree is calculated
Calculate the maximum depth of a binary tree
Explain how the sum of nodes along a path can be computed
Compute and check to see whether a path with a certain sum exists
Describe the original binary tree and its mirror
Implement the mirroring of a binary tree
• Recognize a full binary tree
Write code to check whether a binary tree is full
Recognize a perfect binary tree
Write code to check whether a binary tree is perfect
Recognize a complete binary tree
Write code to check whether a binary tree is complete
Recognize a balanced binary tree
Write code to check whether a binary tree is balanced
Summarize the key concepts covered in this course

## IN THIS COURSE

• After completing this video, you will be able to recognize how the recursive algorithm for counting nodes works.
• 3.  Implementing Count Nodes
During this video, you will learn how to write code to implement the count nodes algorithm.
• 4.  Maximum Depth of a Binary Tree
Upon completion of this video, you will be able to recognize how to calculate the maximum depth of a binary tree.
• 5.  Calculating the Maximum Depth
In this video, you will calculate the maximum depth of a binary tree.
• 6.  Summing The Nodes Along a Path in a Binary Tree
After completing this video, you will be able to explain how the sum of nodes along a path can be computed.
• 7.  Checking for Path Sum
In this video, you will compute and check to see if a path with a certain sum exists.
• 8.  Mirroring a Binary Tree
Upon completion of this video, you will be able to describe the original binary tree and its reflection.
• 9.  Implementing Mirroring
During this video, you will learn how to implement the mirroring of a binary tree.
• 10.  Full Binary Tree
Upon completion of this video, you will be able to recognize a binary tree that is full.
• 11.  Checking Whether a Binary Tree Is Full
Learn how to write code to check if a binary tree is full.
• 12.  Perfect Binary Tree
After completing this video, you will be able to recognize a perfect binary tree.
• 13.  Checking Whether a Binary Tree Is Perfect
Find out how to write code to check if a binary tree is perfect.
• 14.  Complete Binary Tree
After completing this video, you will be able to recognize a binary tree that is complete.
• 15.  Checking Whether a Binary Tree Is Complete
In this video, learn how to write code to check if a binary tree is complete.
• 16.  Balanced Binary Tree
Upon completion of this video, you will be able to recognize a balanced binary tree.
• 17.  Checking Whether a Binary Tree Is Balanced
In this video, you will learn how to write code to check if a binary tree is balanced.
• 18.  Course Summary

## EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion on some of our courses, which can be shared on any social network or business platform.

Digital badges are yours to keep, forever.

## YOU MIGHT ALSO LIKE

Rating 4.6 of 60 users (60)
Rating 4.6 of 178 users (178)
Rating 4.8 of 59 users (59)

## PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.6 of 109 users (109)
Rating 4.6 of 15 users (15)
Rating 4.7 of 45 users (45)