ehlxr/hello-algo
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update binary_tree_types.md

Browse Source 
已简单修改有关完美二叉树的性质部分错误，但字体并不与原文相符，待进一步订正。
This commit is contained in:
yabo083 2022-12-02 20:23:52 +08:00 committed by GitHub
parent d85a14521f
commit a51b3fc60f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
docs/chapter_tree/binary_tree_types.md
View File

@ -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」，又称「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)