名称 | 力扣地址 | 难度 | 标签 |
---|---|---|---|
235. 二叉搜索树的最近公共祖先(中等) | https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/ | ☆☆☆ | 递归、迭代 |
236. 二叉树的最近公共祖先(中等) | https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/ | ☆☆☆ | 递归 |
144. 二叉树的前序遍历(简单) | https://leetcode.cn/problems/binary-tree-preorder-traversal/ | ☆☆ | 递归、迭代 |
94. 二叉树的中序遍历(简单) | https://leetcode.cn/problems/binary-tree-inorder-traversal/ | ☆☆ | 递归、迭代 |
145. 二叉树的后序遍历(简单) | https://leetcode.cn/problems/binary-tree-postorder-traversal/ | ☆☆ | 递归、迭代 |
226. 翻转二叉树(简单) | https://leetcode.cn/problems/invert-binary-tree/ | ☆☆☆ | 递归、迭代 |
102. 二叉树的层序遍历(中等) | https://leetcode.cn/problems/binary-tree-level-order-traversal/ | ☆☆☆ | 递归、迭代 |
104. 二叉树的最大深度(简单) | https://leetcode.cn/problems/maximum-depth-of-binary-tree/ | ☆☆☆ | 递归 |
543. 二叉树的直径(简单) | https://leetcode.cn/problems/diameter-of-binary-tree/ | ☆☆☆ | 递归 |
111. 二叉树的最小深度(简单) | https://leetcode.cn/problems/minimum-depth-of-binary-tree/ | ☆☆☆ | 递归、迭代 |
222. 完全二叉树的节点个数(简单) | https://leetcode.cn/problems/count-complete-tree-nodes/ | ☆☆☆ | 递归、迭代 |
110. 平衡二叉树(简单) | https://leetcode.cn/problems/balanced-binary-tree/ | ☆☆☆☆ | 递归 |
257. 二叉树的所有路径 | https://leetcode.cn/problems/binary-tree-paths/ | ☆☆☆☆ | 递归、迭代 |
404. 左叶子之和(简单) | https://leetcode.cn/problems/sum-of-left-leaves/ | ☆☆☆☆ | 递归、迭代 |
513. 找树左下角的值(中等) | https://leetcode.cn/problems/find-bottom-left-tree-value/ | ☆☆☆☆ | 递归、迭代 |
112. 路径总和(简单) | https://leetcode.cn/problems/path-sum/ | ☆☆☆☆ | 递归、迭代 |
113. 路径总和 II(中等) | https://leetcode.cn/problems/path-sum-ii/ | ☆☆☆☆ | 递归、迭代 |
105. 从前序与中序遍历序列构造二叉树(中等) | https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ | ☆☆☆ | 递归 |
106. 从中序与后序遍历序列构造二叉树(中等) | https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/ | ☆☆☆ | 递归 |
654. 最大二叉树(中等) | https://leetcode.cn/problems/maximum-binary-tree/ | ☆☆☆ | 递归-前序遍历 |
617. 合并二叉树(简单) | https://leetcode.cn/problems/merge-two-binary-trees/ | ☆☆☆ | 递归-前序遍历 |
700. 二叉搜索树中的搜索(简单) | https://leetcode.cn/problems/search-in-a-binary-search-tree/ | ☆☆☆ | 迭代、递归 |
98. 验证二叉搜索树(中等) | https://leetcode.cn/problems/validate-binary-search-tree/ | ☆☆☆ | 遍历 |
530. 二叉搜索树的最小绝对差(简单) | https://leetcode.cn/problems/minimum-absolute-difference-in-bst/ | ☆☆☆ | 遍历 |
501. 二叉搜索树中的众数(简单) | https://leetcode.cn/problems/find-mode-in-binary-search-tree/ | ☆☆☆ | 遍历 |
701. 二叉搜索树中的插入操作(中等) | https://leetcode.cn/problems/insert-into-a-binary-search-tree/ | ☆☆☆ | 递归、迭代 |
450. 删除二叉搜索树中的节点(中等) | https://leetcode.cn/problems/delete-node-in-a-bst/ | ☆☆☆☆ | 递归 |
669. 修剪二叉搜索树(中等) | https://leetcode.cn/problems/trim-a-binary-search-tree/ | ☆☆☆☆ | 递归、迭代 |
108. 将有序数组转换为二叉搜索树(简单) | https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/ | ☆☆☆ | 遍历 |
538. 把二叉搜索树转换为累加树(中等)(LCR 054) | https://leetcode.cn/problems/convert-bst-to-greater-tree/ | ☆☆☆ | 遍历 |
114. 二叉树展开为链表(中等) | https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/ | ☆☆☆ | 遍历 |
116. 填充每个节点的下一个右侧节点指针(中等) | https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/ | ☆☆☆ | 遍历、迭代 |
二叉树刷题目录
于 2023-11-26 15:13:26 首次发布