CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 11:41:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Several bug fixes and improvements. (#887)

Browse Source 
* fix the bugs of C code.

* Add a header figure.

* Improve the definition of tree node height.
This commit is contained in:
Yudong Jin
2023-10-25 22:59:25 +08:00
committed by GitHub
parent 436b6fa9a6
commit d26e811e10
5 changed files with 9 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/chapter_tree/binary_tree.md
View File

@@ -200,7 +200,7 @@
- 节点的「度 degree」：节点的子节点的数量。在二叉树中，度的取值范围是 0、1、2 。
- 二叉树的「高度 height」：从根节点到最远叶节点所经过的边的数量。
- 节点的「深度 depth」：从根节点到该节点所经过的边的数量。
- 节点的「高度 height」：从最远叶节点到该节点所经过的边的数量。
- 节点的「高度 height」：从距离该节点最远的叶节点到该节点所经过的边的数量。
![二叉树的常用术语](binary_tree.assets/binary_tree_terminology.png)