本文精选了多项二叉树相关的算法题目，涵盖了路径求和、树的最大深度、对称树等问题，适合初学者和进阶者练习。每道题目的通过率和难度级别也一并列出。
| 编号 | 题目 | 通过率 | 程度 |
|---|---|---|---|
| 107 | Binary Tree Level Order Traversal II | 39.0% | Easy |
| 257 | Binary Tree Paths | 36.8% | Easy |
| 501 | Find Mode in Binary Search Tree | 38.4% | Easy |
| 437 | Path Sum III | 39.3% | Easy |
| 404 | Sum of Left Leaves | 46.5% | Easy |
| 112 | Path Sum | 33.5% | Easy |
| 110 | Balanced Binary Tree | 36.8% | Easy |
| 108 | Convert Sorted Array to Binary Search Tree | 41.3% | Easy |
| 543 | Diameter of Binary Tree | 42.3% | Easy |
| 226 | Invert Binary Tree | 50.8% | Easy |
| 235 | Lowest Common Ancestor of a Binary Search Tree | 38.5% | Easy |
| 104 | Maximum Depth of Binary Tree | 51.7% | Easy |
| 111 | Minimum Depth of Binary Tree | 32.7% | Easy |
| 101 | Symmetric Tree | 37.9% | Easy |
| 100 | Same Tree | 45.8% | Easy |
扫一扫
03-26
961
961
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
