Revision

Back to Tree

Binary Tree

Tree exploration methods

Depth First Search

Breadth First Search

DFS Preorder, Inorder, Postorder and BFS

Algorithms

Binary Tree ZigZag Level Order Traversal

Populating Next Right Pointers in Each Node

Count possible Binary Search Trees

Generate Binary Search Trees

Trim Binary Search Tree

Is same Tree

Construct Binary Tree from Preorder and Inorder traversal

Construct Binary Tree from Inorder and Postorder traversal

Is Binary Tree balanced

Insert into Binary Search Tree

Is Subtree