Skip to main content
Learning Path
Blogs
Premium
Login
Feedback
Hide Index
Binary Tree
0% completed
Introduction to binary trees
Understanding a binary tree
Key tree terminologies
Types and properties of binary trees
Array implementation of binary trees
Introduction to array based binary trees
Defining a node in binary tree
Structure of a binary tree
Understanding a generic binary tree
Linked list implementation of binary trees
Introduction to linked list based binary trees
Defining a node in binary tree
Structure of a binary tree
Recursive traversals in binary trees
Understanding the problem
Understanding recursive preorder traversal
Implement recursive preorder traversal
Understanding recursive inorder traversal
Implement recursive inorder traversal
Understanding recursive postorder traversal
Implement recursive postorder traversal
Iterative traversals in binary trees
Understanding the problem
Understanding iterative preorder traversal
Implement iterative preorder traversal
Understanding iterative inorder traversal
Implement iterative inorder traversal
Understanding iterative postorder traversal
Implement iterative postorder traversal
Understanding level order traversal
Implement level order traversal
Constructing a binary tree
Challenges in construction from preorder traversal
Challenges in construction from inorder traversal
Challenges in construction from postorder traversal
Understanding construction using preorder and inorder traversal
Construct tree using preorder and inorder traversal
Understanding construction using postorder and inorder traversal
Construct tree using postorder and inorder traversal
Insertion in binary trees
Understanding insertion at root
new
Insert at root
Understanding recursive insertion of a leaf
new
Recursively insert a leaf
Understanding iterative insertion of a leaf
new
Iteratively insert a leaf
Understanding insertion of a child
new
Insert a child
Understanding insertion of a parent
new
Insert a parent
Pattern: Preorder traversal (Stateless)
Understanding the stateless preorder traversal pattern
Identifying the stateless preorder traversal pattern
Sum of path
new
Depth assignment
new
Concatenated path
new
Increasing path
Pattern: Preorder traversal (Stateful)
Understanding the stateful preorder traversal pattern
Identifying the stateful preorder traversal pattern
Duplicates in path
Second minimum
Left view
Right view
Pattern: Postorder traversal (Stateless)
Understanding the stateless postorder traversal pattern
Identifying the stateless postorder traversal pattern
Sum of leaves
Height of binary tree
Maximum path sum
Full binary tree
Perfect binary tree
Collect leaves
Pattern: Postorder traversal (Stateful)
Understanding the stateful postorder traversal pattern
Identifying the stateful postorder traversal pattern
Diameter of tree
Descendants sum count
Distribute coins
Most frequent subtree sum
Longest monotonic path
Monotonic subtree count
Path sum count
Pattern: Root to leaf path (Stateless)
Understanding the stateless root to leaf path pattern
Identifying the stateless root to leaf path pattern
Root to leaf path
Binary summation of tree
new
Even path
new
Odd count
Pattern: Root to leaf path (Stateful)
Understanding the stateful root to leaf path pattern
Identifying the stateful root to leaf path pattern
Root to leaf paths
new
Equal paths
new
Duplicate paths
new
Prefix paths
Pattern: Level order traversal
Understanding the level order traversal pattern
Identifying the level order traversal pattern
Level sum
Deepest leaves sum
Complete binary tree
Zigzag traversal
Cousin check
Pattern: Level order column traversal
Understanding the level order column traversal pattern
Identifying the level order column traversal pattern
Top view
Bottom view
Vertical traversal
new
Diagonal traversal
Pattern: Lowest common anscestor
Understanding the lowest common ancestor pattern
Identifying the lowest common ancestor pattern
Lowest Common Ancestor
Lowest Common Ancestor II
Random Lowest Common Ancestor
Deepest Lowest common ancestor
Distance between nodes
Pattern: Simultaneous traversal
Understanding the simultaneous traversal pattern
Identifying the simultaneous traversal pattern
Identical trees
Symmetry detection
Subtree detection
Merge trees
Practice: Mix traversals
Boundary traversal
Assessments
Assessment 1
Assessment 2
Certificate
Certificate
Liking the course? Check our
discounted
plans to continue learning.
Subscribe