> For the complete documentation index, see [llms.txt](https://leetcodebook-1.gitbook.io/top-interview-150/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://leetcodebook-1.gitbook.io/top-interview-150/tree.md).

# 树

- [二叉树的最大深度](https://leetcodebook-1.gitbook.io/top-interview-150/tree/maximum-depth-of-binary-tree.md)
- [相同的树](https://leetcodebook-1.gitbook.io/top-interview-150/tree/same-tree.md)
- [翻转二叉树](https://leetcodebook-1.gitbook.io/top-interview-150/tree/invert-binary-tree.md)
- [对称二叉树](https://leetcodebook-1.gitbook.io/top-interview-150/tree/symmetric-tree.md)
- [填充每个节点的下一个右侧节点指针](https://leetcodebook-1.gitbook.io/top-interview-150/tree/populating-next-right-pointers-in-each-node.md)
- [二叉树展开为链表](https://leetcodebook-1.gitbook.io/top-interview-150/tree/flatten-binary-tree-to-linked-list.md)
- [从前序和中序遍历序列构造二叉树](https://leetcodebook-1.gitbook.io/top-interview-150/tree/construct-binary-tree-from-preorder-and-inorder-traversal.md)
- [求根节点到叶节点数字之和](https://leetcodebook-1.gitbook.io/top-interview-150/tree/sum-root-to-leaf-numbers.md)
- [二叉树中最大路径和](https://leetcodebook-1.gitbook.io/top-interview-150/tree/binary-tree-maximum-path-sum.md)
- [二叉搜索树迭代器](https://leetcodebook-1.gitbook.io/top-interview-150/tree/binary-search-tree-iterator.md)
- [完全二叉树的节点个数](https://leetcodebook-1.gitbook.io/top-interview-150/tree/count-complete-tree-nodes.md)
- [二叉树的最近公共祖先](https://leetcodebook-1.gitbook.io/top-interview-150/tree/lowest-common-ancestor-of-a-binary-tree.md)
- [二叉树的右视图](https://leetcodebook-1.gitbook.io/top-interview-150/tree/binary-tree-right-side-view.md)
- [二叉树的层平均值](https://leetcodebook-1.gitbook.io/top-interview-150/tree/average-of-levels-in-binary-tree.md)
- [二叉树的层序遍历](https://leetcodebook-1.gitbook.io/top-interview-150/tree/binary-tree-level-order-traversal.md)
- [二叉树的锯齿形层序遍历](https://leetcodebook-1.gitbook.io/top-interview-150/tree/binary-tree-zigzag-level-order-traversal.md)
- [二叉搜索树的最小绝对差](https://leetcodebook-1.gitbook.io/top-interview-150/tree/minimum-absolute-difference-in-bst.md)
- [二叉搜索树中第K小的元素](https://leetcodebook-1.gitbook.io/top-interview-150/tree/kth-smallest-element-in-a-bst.md)
- [验证二叉搜索树](https://leetcodebook-1.gitbook.io/top-interview-150/tree/validate-binary-search-tree.md)