Ultimate DSA Interview Prep: 8/12 Trees

A curated list of LeetCode problems covering key concepts and techniques to help you prepare for your next DSA interview.

1. Arrays & Strings
2. Hashmaps & Sets
3. 2 Pointers
4. Stacks
5. Linked List
6. Binary Search
7. Sliding Window
8. Trees
9. Heaps
10. Recursive Backtracking
11. Graphs
12. Dynamic Programming

Trees

Easy:

1. https://leetcode.com/problems/invert-binary-tree/description/
2. https://leetcode.com/problems/maximum-depth-of-binary-tree/
3. https://leetcode.com/problems/balanced-binary-tree/description/
4. https://leetcode.com/problems/diameter-of-binary-tree/description/
5. https://leetcode.com/problems/same-tree/description/
6. https://leetcode.com/problems/symmetric-tree/
7. https://leetcode.com/problems/path-sum/
8. https://leetcode.com/problems/minimum-absolute-difference-in-bst/

Medium: