应用题-二叉树专题-把二叉搜索树转换为累加树
```python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val
应用题-二叉树专题-将有序数组转换为二叉搜索树
```python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val
应用题-二叉树专题-修剪二叉搜索树(非常值得寻味的题)
```python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val
应用题-二叉树专题-二叉树的最近公共祖先 ( 需要注意写一下 )
```python # Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None
应用题-二叉树专题-二叉搜索树的最小绝对
遇到在二叉搜索树上求最值，求差值之类的， 都要思考一下二叉搜索树是有序的，利用好这个特点。 ```python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, le
应用题-二叉树专题-验证二叉搜索树
**~~错误写法~~** 想简单了, 注意二叉搜索树的概念 例如下面这个测试用例, 下面代码就通过不了 **[5,4,6,null,null,3,7]** ```python # Definition for a binary tree node. # class TreeNode:
应用题-二叉树专题-二叉搜索树中的搜索
**迭代** ```python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.va
应用题-二叉树专题-合并二叉树
```python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val
应用题-二叉树专题-最大二叉树
**线性求最大值** ```python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # sel
应用题-二叉树专题-从中序与后序遍历序列构造二叉树
```python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val