| 序号 | 题目 | 备注 | |
|---|---|---|---|
| 牛客：剑指offer | |||
- [x] |
| JZ55 | 二叉树的深度 | 递归；层次遍历；
Importantmorris遍历：时间O(n)，空间O(1) |
|
- [x]
| JZ77 | 按之字形顺序打印二叉树 | - |
|
- [x]
| JZ54 | 二叉搜索树的第k个节点 | |
|
- [x]
| JZ26 | 树的子结构 | 注意空树的情况 |
|
- [x]
| JZ27 | 二叉树的镜像 | |
|
- [x]
| JZ32 | 从上往下打印二叉树 | |
|
- [x]
| JZ33 | 二叉搜索树的后序遍历序列 | |
|
- [x]
| JZ82 | 二叉树中和为某一值的路径（一） | |
|
- [x]
| JZ34 | 二叉树中和为某一值的路径（二） | 注意浅拷贝和深拷贝 |
|
- [x]
| JZ36 | 二叉搜索树与双向链表 | 原树操作 |
|
- [x]
| JZ79 | 判断是不是平衡二叉树 | 递归算高度 |
|
- [x]
| JZ8 | 二叉树的下一个节点 | 考虑没有下一个的情况 |
|
- [x]
| JZ28 | 对称的二叉树 | 考虑空树 |
|
- [x]
| JZ37 | Important序列化二叉树 |
|
|
- [x]
| JZ84 | Important二叉树中和为某一值的路径（三） | 对每个节点都计算一遍从其开始的path
|
|
- [x]
| JZ85 | 在二叉树中找到两个节点的最近公共祖先 | 最近公共祖先特性：两边各有一个/中间一个两边中的一边有一个 |
|
- [x]
| JZ68 | 二叉搜索树的最近公共祖先 | 二叉搜索树可以根据值进行更快的判断 |
| Leetcode | | | |
|
- [ ]
| 94 | | |
|
- [ ]
| 96 | | |
|
- [ ]
| 98 | | |
|
- [ ]
| 99 | | |
|
- [ ]
| 100 | | |
|
- [ ]
| 101 | | |
|
- [ ]
| 102 | | |
|
- [ ]
| 103 | | |
|
- [ ]
| 104 | | |
|
- [ ]
| 107 | | |
|
- [ ]
| 108 | | |
|
- [ ]
| 110 | | |
|
- [ ]
| 111 | | |
|
- [ ]
| 112 | | |
|
- [ ]
| 113 | | |
|
- [ ]
| 114 | | |
|
- [ ]
| 124 | | |
|
- [ ]
| 129 | | |
|
- [ ]
| 144 | | |
|
- [ ]
| 145 | | |
|
- [ ]
| 173 | | |
|
- [ ]
| 199 | | |
|
- [ ]
| 222 | | |
|
- [ ]
| 226 | | |
|
- [ ]
| 230 | | |
|
- [ ]
| 235 | | |
|
- [ ]
| 236 | | |
|
- [ ]
| 257 | | |
|
- [ ]
| 404 | | |
|
- [ ]
| 437 | | |
|
- [ ]
| 515 | | |
|
- [ ]
| 637 | | |
|
- [ ]
| 993 | | |
| Binary indexed tree | | | |
|
|
- [ ]
| 218 | | |
|
- [ ]
| 307 | | |
|
- [ ]
| 308 | | |
|
- [ ]
| 315 | | |
|
- [ ]
| 327 | | |
|
- [ ]
| 493 | | |
| Segment tree | | | |
|
|
- [ ]
| 218 | | |
|
- [ ]
| 307 | | |
|
- [ ]
| 308 | | |
|
- [ ]
| 315 | | |
|
- [ ]
| 327 | | |
|
- [ ]
| 493 | | |
|
- [ ]
| 699 | | |
|
- [ ]
| 715 | | |
|
- [ ]
| 732 | | |
|
- [ ]
| 850 | | |
|
- [ ]
| 1157 | | |
若有收获，就点个赞吧
0 人点赞
