Learning Path
Blogs
Premium
Login
Send
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 of 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 array based binary trees
Defining a node in binary tree
Structure of a binary tree
Introduction to recursive tree traversals
Introduction
Recursive preorder traversal
Recursive inorder traversal
Recursive postorder traversal
Introduction to Iterative tree traversals
Introduction
Iterative preorder traversal
Iterative inorder traversal
Iterative postorder traversal
Constructing a binary tree
Construction from preorder traversal
Construction from inorder traversal
Construction from postorder traversal
Preorder and inorder reconstruction
Postorder and inorder reconstruction
Pattern: Recursive traversal
Second minimum
Collect leaves
Boundary traversal
Flip the tree
Descendants sum count
Distribute coins
Pattern: Two trees
Identical trees
Symmetry detection
Leaf Similarity Check
Merge trees
Pattern: Subtrees
Subtree detection
Monotonic subtree count
Duplicate subtrees
Most frequent subtree sum
Pattern: Level order traversal
Level order traversal
Reverse level order traversal
Zigzag traversal
Level maximum
Level sum
Maximum level sum
Level average
Sum of leaves
Deepest leaves sum
Maximum width
Cousin check
Vertical order traversal
Pattern: Root to leaf path
Height of binary tree
Longest zigzag path
Root to leaf path
Maximum path sum
Binary summation of tree
Root to leaf path II
Pattern: Path between nodes
Diameter of tree
Monotonic path
Path sum count
Distance between nodes
K distant nodes
Pattern: Lowest common anscestor
Lowest Common Ancestor
Lowest Common Ancestor II
Random Lowest Common Ancestor
Deepest Lowest common ancestor
Pattern: Tree types
Complete binary tree
Full binary tree
Perfect binary tree
Pattern: Tree views
Left view
Right view
Top view
Bottom view
Pattern: Tree restructuring
Add a new level
Subtree removal
Eliminate target leaves
Build a forest
Assessments
Assessment 1
Assessment 2
Certificate
Certificate
Liking the course? Start a
FREE
trial to continue learning.
Start free trial