Goals¶
- Know how to search for values in binary search tree in optimal way
- Understand and be able to implement the following types of traversals, including when to use them and their tradeoffs
- In-order, pre-order, post-order
- BFS
- DFS
- Understand how to implement at least one traversal in iterative approach
- Understand the concept of augmented trees and when they can be useful
Monday¶
Wednesday¶
- Invert Binary Tree - LeetCode
- Symmetric Tree - LeetCode
- Balanced Binary Tree - LeetCode
- Validate Binary Search Tree - LeetCode
- Binary Tree Pruning - LeetCode
- Kth Smallest Element in a BST - LeetCode
Saturday¶
- Binary Tree Level Order Traversal II - LeetCode
- Minimum Depth of Binary Tree - LeetCode
- Flatten Binary Tree to Linked List - LeetCode
- Find Duplicate Subtrees - LeetCode
Bonus¶
- Subtree of Another Tree - LeetCode
- Most Frequent Subtree Sum - LeetCode
- Convert Sorted Array to Binary Search Tree - LeetCode
- Print a Binary Tree in Vertical Order | Set 1 - GeeksforGeeks
- Path Sum - LeetCode
- Minimum Depth of Binary Tree - LeetCode
- Flatten Binary Tree to Linked List - LeetCode