algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-01 20:12:07 +08:00
Code Issues Packages Projects Releases Wiki Activity

1. Add build script for Java.

Browse Source 
2. Add height limitation for code blocks in extra.css.
3. Fix "节点" to "结点".
This commit is contained in:
krahets
2023-02-07 04:43:52 +08:00
parent b14568151c
commit ecbf2d1560
54 changed files with 457 additions and 1633 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/python/chapter_tree/avl_tree.py
View File

@ -43,7 +43,7 @@ class AVLTree:
# 更新结点高度
self.__update_height(node)
self.__update_height(child)
# 返回旋转后子树的根节点
# 返回旋转后子树的根结点
return child
""" 左旋操作 """
@ -56,7 +56,7 @@ class AVLTree:
# 更新结点高度
self.__update_height(node)
self.__update_height(child)
# 返回旋转后子树的根节点
# 返回旋转后子树的根结点
return child
""" 执行旋转操作，使该子树重新恢复平衡 """

4
codes/python/chapter_tree/binary_tree.py
View File

@ -13,7 +13,7 @@ from include import *
""" Driver Code """
if __name__ == "__main__":
""" 初始化二叉树 """
# 初始化节点
# 初始化结点
n1 = TreeNode(val=1)
n2 = TreeNode(val=2)
n3 = TreeNode(val=3)
@ -29,7 +29,7 @@ if __name__ == "__main__":
""" 插入与删除结点 """
P = TreeNode(0)
# 在 n1 -> n2 中间插入节点 P
# 在 n1 -> n2 中间插入结点 P
n1.left = P
P.left = n2
print("\n插入结点 P 后\n")

2
codes/python/chapter_tree/binary_tree_bfs.py
View File

@ -18,7 +18,7 @@ def hier_order(root: Optional[TreeNode]):
res = []
while queue:
node = queue.popleft() # 队列出队
res.append(node.val) # 保存节点值
res.append(node.val) # 保存结点值
if node.left is not None:
queue.append(node.left) # 左子结点入队
if node.right is not None: