1
0
Fork 0
Obsidian 管理的个人笔记仓库
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

17 lines
312 B

用前中后序遍历二叉树
## 二叉搜索树
> Binary Search Tree
left (包括其后代) value <= root value
right (包括其后代) value >= root value
### 求二叉搜索树的第 K 小值
## 平衡二叉搜索树
## 红黑树 / 自平衡二叉搜索树
>通过颜色转换来维持树的平衡
>