Binary Trees⚓︎
Binary Tree Traversal⚓︎
- 144: Binary Tree Preorder Traversal: \({\color{yellow}Template}\)
- 94: Binary Tree Inorder Traversal: \({\color{yellow}Template}\)
- 145: Binary Tree Postorder Traversal: \({\color{yellow}Template}\)
- 102: Binary Tree Level Order Traversal: \({\color{yellow}Template}\)
- 103: Binary Tree Zigzag Level Order Traversal
- 314: Binary Tree Vertical Order Traversal
- 987: Vertical Order Traversal of a Binary Tree
Binary Tree Properties⚓︎
- 104: Maximum Depth of Binary Tree
- 111: Minimum Depth of Binary Tree
- 662: Maximum Width of Binary Tree
- 110: Balanced Binary Tree
- 958: Check Completeness of a Binary Tree
- 222: Count Complete Tree Nodes
- 101: Symmetric Tree
- 100: Same Tree
Binary Tree Serialization and Deserialization⚓︎
- 297: Serialize and Deserialize Binary Tree: \({\color{yellow}Template}\)
- 105: Construct Binary Tree from Preorder and Inorder Traversal
- 106: Construct Binary Tree from Inorder and Postorder Traversal
Operations on Binary Trees⚓︎
Binary Tree Path Sum⚓︎
Binary Search Tree Properties⚓︎
- 700: Search in a Binary Search Tree
- 98: Validate Binary Search Tree
- 530: Minimum Absolute Difference in BST
Operations on Binary Search Trees⚓︎
Lowest Common Ancestor (LCA)⚓︎
- 236: Lowest Common Ancestor of a Binary Tree: \({\color{yellow}Template}\)
- 1644: Lowest Common Ancestor of a Binary Tree II
- 1650: Lowest Common Ancestor of a Binary Tree III
- 235: Lowest Common Ancestor of a Binary Search Tree