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

Java    |    Intermediate
  • 18 videos | 1h 24m 57s
  • Includes Assessment
  • Earns a Badge
Rating 4.3 of 12 users 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

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

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

Book Data Structures and Algorithms with Go: Create efficient solutions and optimize your Go coding skills
Book 100 Java Mistakes and How to Avoid Them
Course Advanced Data Structures & Algorithms in Java: Working with the Binary Heap
Rating 4.6 of 15 users Rating 4.6 of 15 users (15)

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Course Advanced Data Structures & Algorithms in Java: Working with the Binary Heap
Rating 4.6 of 15 users Rating 4.6 of 15 users (15)
Course Control Structures in C++: Range-based for Loops
Rating 4.5 of 26 users Rating 4.5 of 26 users (26)
Course Using messaging & call tools in Teams 2023
Rating 4.7 of 45 users Rating 4.7 of 45 users (45)