|
|
|
@ -16,7 +16,7 @@ comments: true
|
|
|
|
|
|
|
|
|
|
完美二叉树的性质有:
|
|
|
|
|
|
|
|
|
|
- 若树高度 $= h$ ,则结点总数 $= 2^h$ ;
|
|
|
|
|
- 若树高度 $= h$ ,则结点总数 $= 2^h$ - 1;
|
|
|
|
|
|
|
|
|
|
## 完全二叉树
|
|
|
|
|
|
|
|
|
@ -38,4 +38,4 @@ comments: true
|
|
|
|
|
|
|
|
|
|
**「平衡二叉树 Balanced Binary Tree」,又称「AVL 树」** ,其任意结点的左子树和右子树的高度之差的绝对值 $\leq 1$ 。
|
|
|
|
|
|
|
|
|
|
![balanced_binary_tree](binary_tree_types.assets/balanced_binary_tree.png)
|
|
|
|
|
![balanced_binary_tree](binary_tree_types.assets/balanced_binary_tree.png)
|
|
|
|
|