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
Types and properties of binary trees
Binary trees come in all shapes and sizes. Some binary trees, however, are special as they fulfill some special properties that make them more useful than others in some cases. These special binary trees can be generalized and studied more easily once we categorize them. Let us look at some special binary tree types and their unique properties.
Full binary tree
A full Binary tree is a binary tree in which every node has two or no children. It is also known as a proper binary tree.
Liking the course? Check our discounted plans to continue learning.