codeintuition-logo
Learning PathBlogsPremiumLogin
codeintuition-logo

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
Understanding recursive insertion of a leaf
Understanding iterative insertion of a leaf
Understanding insertion of a child
Understanding insertion of a parent

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

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? Check our discounted plans to continue learning.

Subscribe now