Tree Data Structure š
Trees
Traversal
| Topics | Status |
|---|---|
| Introduction to Trees | noteš |
| Binary Tree Representation | doneā |
| Preorder Traversal | doneā |
| Postorder Traversal | doneā |
| Inorder Traversal | doneā |
| Level Order Traversal | doneā |
| Postorder Preorder Inorder traversal in one Traversal | doneā |
Medium Problems
| Topics | Status |
|---|---|
| Height and Diameter of a Binary Tree | doneā |
| Maximum Path Sum | doneā |
| Check if two trees are identical | doneā |
| Views of Binary Tree | doneā |
| Symmetric Binary Tree | doneā |
Hard Problems
| Topics | Status |
|---|---|
| Root to Node Path in Binary Tree | doneā |
| LCA in Binary Tree | doneā |
| Maximum Width of a Binary Tree | doneā |
| Check for Children Sum Property | doneā |
| Print all Nodes at a distance of K | doneā |
| Minimum Time Taken to Burn the Binary Tree | doneā |
| Count Total Nodes in a Complete Binary Tree | doneā |
| Construct Binary Tree from traversals | doneā |
| Serialize and Deserialize Binary Tree | doneā |
| Morris Traversal | doneā |
| Flatten Binary Tree to Linked List | doneā |
Binary Search Trees
Concept
| Topic | Status |
|---|---|
| Introduction to Binary Search Trees | noteš |
| Search in a Binary Search Tree | doneā |
| Find Min and Max in a BST | doneā |
Problems
| Topic | Status |
|---|---|
| Ceil and Floor in a BST | doneā |
| Insertion and Deletion in a BST | doneā |
| Find K smallest and largest element in a BST | doneā |
| Check if a Tree is BST or BT | doneā |
| LCA in a Binary Search Tree | doneā |
| Construct BST from preorder traversal | doneā |
| Inorder Successor and Predecessor in BST | doneā |
| Merge 2 BST | doneā |
| Two Sum in a BST | doneā |
| Recover BST with two nodes swapper | doneā |
| Largest BST in a BT | doneā |