1. 二叉树的前序遍历#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/binary-tree-preorder-traversal/
2. 二叉树的中序遍历#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/binary-tree-inorder-traversal/
3. 二叉树的后序遍历#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/binary-tree-postorder-traversal/
4. 二叉树的层序遍历#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/binary-tree-level-order-traversal/
5. 翻转二叉树#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/invert-binary-tree/
题解: https://programmercarl.com/0226.%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.html
6. 对称二叉树#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/symmetric-tree/
题解: https://programmercarl.com/0101.%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.html
7. 二叉树的最大深度#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/maximum-depth-of-binary-tree/
8. 二叉树的最小深度#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/minimum-depth-of-binary-tree/
9. 完全二叉树的节点个数#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/count-complete-tree-nodes/
10. 平衡二叉树#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/balanced-binary-tree/
题解: https://programmercarl.com/0110.%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.html
11. 二叉树的所有路径#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/binary-tree-paths/
12. 左叶子之和#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/sum-of-left-leaves/
题解: https://programmercarl.com/0404.%E5%B7%A6%E5%8F%B6%E5%AD%90%E4%B9%8B%E5%92%8C.html
13. 找树左下角的值#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/find-bottom-left-tree-value/
题解: https://programmercarl.com/0513.%E6%89%BE%E6%A0%91%E5%B7%A6%E4%B8%8B%E8%A7%92%E7%9A%84%E5%80%BC.html
14. 路径总和#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/path-sum/
题解: https://programmercarl.com/0112.%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C.html
15. 从中序与后序遍历序列构造二叉树#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/
16. 最大二叉树#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/maximum-binary-tree/
题解: https://programmercarl.com/0654.%E6%9C%80%E5%A4%A7%E4%BA%8C%E5%8F%89%E6%A0%91.html
17. 合并二叉树#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/merge-two-binary-trees/
题解: https://programmercarl.com/0617.%E5%90%88%E5%B9%B6%E4%BA%8C%E5%8F%89%E6%A0%91.html
18. 二叉搜索树中的搜索#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/search-in-a-binary-search-tree/
19. 验证二叉搜索树#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/validate-binary-search-tree/
题解: https://programmercarl.com/0098.%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.html
20. 二叉搜索树的最小绝对差#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/minimum-absolute-difference-in-bst/
21. 二叉搜索树中的众数#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/find-mode-in-binary-search-tree/
22. 二叉树的最近公共祖先#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/
23. 二叉搜索树的最近公共祖先#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/
24. 二叉搜索树中的插入操作#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/insert-into-a-binary-search-tree/
25. 删除二叉搜索树中的节点#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/delete-node-in-a-bst/
26. 修剪二叉搜索树#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/trim-a-binary-search-tree/
题解: https://programmercarl.com/0669.%E4%BF%AE%E5%89%AA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.html
27. 将有序数组转换为二叉搜索树#
难度: 🟢 简单
算法链接: https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/
28. 把二叉搜索树转换为累加树#
难度: 🟡 中等
算法链接: https://leetcode.cn/problems/convert-bst-to-greater-tree/