Hide Index
Binary Tree
0% completed
Introduction to binary trees
Array implementation of binary trees
Linked list implementation of binary trees
Recursive traversals in binary trees
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
Pattern: Preorder traversal (Stateless)
Pattern: Preorder traversal (Stateful)
Pattern: Postorder traversal (Stateless)
Pattern: Postorder traversal (Stateful)
Pattern: Root to leaf path (Stateless)
Pattern: Root to leaf path (Stateful)
Pattern: Level order traversal
Pattern: Level order traversal (Columns)
Pattern: Lowest common anscestor
Pattern: Simultaneous traversal
Practice: Mix traversals
Assessments
Certificate
Identifying the lowest common ancestor pattern
The lowest common ancestor finding technique can only solve certain types of binary tree problems. These are generally easy or medium problems where we need to find the lowest common ancestor for a set of nodes in a tree. Finding the lowest common ancestor may directly solve the problem or only a part of it.
If the problem statement or its solution follows the generic template below, it can be solved using the lowest common ancestor finding technique.
Template:
Given a binary tree and a set of nodes, find the lowest common ancestor node.
Liking the course? Check our discounted plans to continue learning.