algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 04:31:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix Python code.

Browse Source
This commit is contained in:
krahets
2023-10-14 22:15:02 +08:00
parent 2976d9ff56
commit ada37fd1f8
2 changed files with 9 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
docs/chapter_tree/avl_tree.md
View File

@ -216,7 +216,7 @@ AVL 树既是二叉搜索树也是平衡二叉树，同时满足这两类二叉
```python title="avl_tree.py"
[class]{AVLTree}-[func]{height}
[class]{AVLTree}-[func]{__update_height}
[class]{AVLTree}-[func]{update_height}
```
=== "C++"
@ -418,7 +418,7 @@ AVL 树的特点在于“旋转”操作，它能够在不影响二叉树的中
=== "Python"
```python title="avl_tree.py"
[class]{AVLTree}-[func]{__right_rotate}
[class]{AVLTree}-[func]{right_rotate}
```
=== "C++"
@ -502,7 +502,7 @@ AVL 树的特点在于“旋转”操作，它能够在不影响二叉树的中
=== "Python"
```python title="avl_tree.py"
[class]{AVLTree}-[func]{__left_rotate}
[class]{AVLTree}-[func]{left_rotate}
```
=== "C++"
@ -605,7 +605,7 @@ AVL 树的特点在于“旋转”操作，它能够在不影响二叉树的中
=== "Python"
```python title="avl_tree.py"
[class]{AVLTree}-[func]{__rotate}
[class]{AVLTree}-[func]{rotate}
```
=== "C++"
@ -685,7 +685,7 @@ AVL 树的节点插入操作与二叉搜索树在主体上类似。唯一的区
```python title="avl_tree.py"
[class]{AVLTree}-[func]{insert}
[class]{AVLTree}-[func]{__insert_helper}
[class]{AVLTree}-[func]{insert_helper}
```
=== "C++"
@ -785,7 +785,7 @@ AVL 树的节点插入操作与二叉搜索树在主体上类似。唯一的区
```python title="avl_tree.py"
[class]{AVLTree}-[func]{remove}
[class]{AVLTree}-[func]{__remove_helper}
[class]{AVLTree}-[func]{remove_helper}
```
=== "C++"