第 13 章指针三剑客之二：树

13.1 数据结构介绍

13.2 树的递归
[104.二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/description/)
[110.平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/description/)
[543.二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/)
[437.路径总和3](https://leetcode.cn/problems/path-sum-iii/)
[101.对称二叉树](https://leetcode.cn/problems/symmetric-tree/description/)
[1110.删点成林](https://leetcode.cn/problems/delete-nodes-and-return-forest/)

13.3 层次遍历
[637.二叉树的层平均值](https://leetcode.cn/problems/average-of-levels-in-binary-tree/description/)

13.4 前中后序遍历
[105.从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/)
[144.二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/description/)

13.5 二叉查找树
[99.恢复二叉搜索树](https://leetcode.cn/problems/recover-binary-search-tree/)
[669.修剪二叉树](https://leetcode.cn/problems/trim-a-binary-search-tree/)

13.6 字典树
[208. 实现 Trie (前缀树)](https://leetcode.cn/problems/implement-trie-prefix-tree/description/)

13.7 练习
[226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/description/)
[617.合并二叉树](https://leetcode.cn/problems/merge-two-binary-trees/)
[572.另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/description/)
[404.左叶子之和](https://leetcode.cn/problems/sum-of-left-leaves/description/)
[513.找左下角的值](https://leetcode.cn/problems/find-bottom-left-tree-value/description/)
[538. 把二叉搜索树转换为累加树](https://leetcode.cn/problems/convert-bst-to-greater-tree/description/)
[530. 二叉搜索树的最小绝对差](https://leetcode.cn/problems/minimum-absolute-difference-in-bst/)
[]()

第 13 章 指针三剑客之二：树

第 13 章指针三剑客之二：树