|
1 | 1 | ####Category |
| 2 | +```html |
| 3 | +Tree Problem |
| 4 | + 1. Iterative |
| 5 | + 1.1) Use stack to simulate recursive DFS |
| 6 | + 1.2) BFS with queue |
| 7 | + 2. Recursive |
| 8 | + 2.1) visit root first = pre-order = top-down = preorder traversal |
| 9 | + 2.2) visit root last = post-order = bottom-up = divide and conquer |
| 10 | +``` |
| 11 | + |
| 12 | + |
2 | 13 | | Type| #| Description| |
3 | 14 | | ---------------------: |:---:| ------------ |
4 | 15 | |**`Trie`**||*1 dict + input`strings` contains only a-z*| |
|
21 | 32 | | inorder + prev| 099|[Recover Binary Search Tree](https://github.com/interviewcoder/leetcode/tree/master/src/_099_RecoverBinarySearchTree)| |
22 | 33 | | inorder + prune| Lint|[Search Range In Binary Search Tree](https://github.com/interviewcoder/lintcode/blob/master/03_binarytree%26divideconquer/_02_SearchRangeInBinarySearchTree/Solution.java)| |
23 | 34 | | inorder + iterative| 173|[Binary Search Tree Iterator](https://github.com/interviewcoder/leetcode/blob/master/src/_173_BinarySearchTreeIterator/Solution.java)| |
24 | | -|--------------------------------| ----| -------------------------------------------------| |
|