本文探讨了二叉树的深度计算、搜索策略（如平衡查找和路径查询）、结构变化（如转换为链表和插入删除操作），并涉及关键函数如最大深度、最小子树和最近值查找。深入解析了BST验证、平均值最大子树和最近公共祖先等经典问题。
一、二叉树求值
Maximum Depth of Binary Tree
Balanced Binary Tree
Validate Binary Search Tree
Minimum Subtree
Subtree with Maximum Average
Lowest Common Ancestor of a Binary Search Tree
Lowest Common Ancestor of a Binary Tree
Lowest Common Ancestor II
Lowest Common Ancestor III
Binary Tree Paths
Binary Tree Path Sum
Binary Tree Path Sum II
Binary Tree Path Sum III
二、二叉树结构变化
Convert Binary Tree to Linked Lists by Depth
Binary Tree Zigzag Level Order Traversal
Serialize and Deserialize Binary Tree
Flatten Binary Tree to Linked List
Invert Binary Tree
Insert Node in a Binary Search Tree
Remove Node in Binary Search Tree
三、二叉树搜索
Closest Binary Search Tree Value
Closest Binary Search Tree Value II
Search Range in Binary Search Tree
Kth Smallest Element in a BST
Two Sum IV - Input is a BST
扫一扫
130
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
