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

newInsert at root

Understanding recursive insertion of a leaf

newRecursively insert a leaf

Understanding iterative insertion of a leaf

newIteratively insert a leaf

Understanding insertion of a child

newInsert a child

Understanding insertion of a parent

newInsert a parent

Pattern: Preorder traversal (Stateless)

Understanding the stateless preorder traversal pattern

Identifying the stateless preorder traversal pattern

newDepth assignment

newConcatenated path

newIncreasing path

Pattern: Preorder traversal (Stateful)

Understanding the stateful preorder traversal pattern

Identifying the stateful preorder traversal pattern

Duplicates in path

Pattern: Postorder traversal (Stateless)

Understanding the stateless postorder traversal pattern

Identifying the stateless postorder traversal pattern

Height of binary tree

Maximum path sum

Full binary tree

Perfect binary tree

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

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

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

newDuplicate paths

newPrefix paths

Pattern: Level order traversal

Understanding the level order traversal pattern

Identifying the level order traversal pattern

Deepest leaves sum

Complete binary tree

Zigzag traversal

Pattern: Level order traversal (Columns)

Vertical traversal

newDiagonal 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

Practice: Mix traversals

Boundary traversal

Assessments

Certificate

Understanding iterative inorder traversal

Just like the preorder traversal, to understand the iterative implementation of inorder traversal, we need to split the whole process into small steps and understand how each step functions. Let us start by looking at how inorder traversal is done.

Step 1: Recursively traverse the node's `left` subtree.

Step 2: Visit the node.

Step 3: Recursively traverse the node's `right` subtree.

Iterative Steps

Liking the course? Check our discounted plans to continue learning.