Trees problems

Traversing and reasoning about hierarchical, branching structures.

  1. Invert Binary Tree (Easy)
  2. Maximum Depth of Binary Tree (Easy)
  3. Diameter of Binary Tree (Easy)
  4. Balanced Binary Tree (Easy)
  5. Same Tree (Easy)
  6. Subtree of Another Tree (Easy)
  7. Binary Tree Level Order Traversal (Medium)
  8. Binary Tree Right Side View (Medium)
  9. Lowest Common Ancestor of a Binary Search Tree (Medium)
  10. Count Good Nodes in Binary Tree (Medium)
  11. Validate Binary Search Tree (Medium)
  12. Kth Smallest Element in a BST (Medium)
  13. Construct Binary Tree from Preorder and Inorder Traversal (Medium)
  14. Binary Tree Maximum Path Sum (Hard)
  15. Serialize and Deserialize Binary Tree (Hard)