This folder contains tree problems.
- Balanced Binary Tree (Easy 110)
- Symmetric Tree (Easy 101)
- Path Sum (Easy 112)
- Convert Sorted Array to Binary Search Tree (Easy 108)
- Lowest Common Ancestor of a Binary Search Tree (Easy 235)
- Diameter of Binary Tree (Easy 543)
- Search in a Binary Search Tree (Easy 700)
- Binary Tree Level Order Traversal (Medium 102)
- Lowest Common Ancestor of a Binary Tree (Medium 236)
- Construct Binary Tree from Preorder and Inorder Traversal (Medium 105)
- Validate Binary Search Tree (Medium 98)
- Populating Next Right Pointers in Each Node (Medium 116)
- Convert Sorted List to Binary Search Tree (Medium 109)
- Kth Smallest Element in a BST (Medium 230)
- Construct Binary Search Tree from Preorder Traversal (Medium 1008)