Trees 📂
This section contains problems belonging to the Trees category.
Problems
- 🟢 Easy: Invert Binary Tree
- 🟢 Easy: Maximum Depth of Binary Tree
- 🟢 Easy: Diameter of Binary Tree
- 🟢 Easy: Balanced Binary Tree
- 🟢 Easy: Same Tree
- 🟢 Easy: Subtree of Another Tree
- 🟡 Medium: Lowest Common Ancestor of a Binary Search Tree
- 🟡 Medium: Binary Tree Level Order Traversal
- 🟡 Medium: Binary Tree Right Side View
- 🟡 Medium: Count Good Nodes In Binary Tree
- 🟡 Medium: Validate Binary Search Tree
- 🟡 Medium: Kth Smallest Element In a BST
- 🟡 Medium: Construct Binary Tree from Preorder and Inorder Traversal
- 🔴 Hard: Binary Tree Maximum Path Sum
- 🔴 Hard: Serialize and Deserialize Binary Tree