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

refactor: Replace 结点 with 节点 (#452)

Browse Source 
* Replace 结点 with 节点
Update the footnotes in the figures

* Update mindmap

* Reduce the size of the mindmap.png
This commit is contained in:
Yudong Jin
2023-04-09 04:32:17 +08:00
committed by GitHub
parent 3f4e32b2b0
commit 1c8b7ef559
395 changed files with 2056 additions and 2056 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/python/modules/binary_tree.py
View File

@ -9,10 +9,10 @@ from collections import deque
class TreeNode:
""" Definition for a binary tree node """
def __init__(self, val: int = 0):
self.val: int = val # 结点值
self.height: int = 0 # 结点高度
self.left: TreeNode | None = None # 左子结点引用
self.right: TreeNode | None = None # 右子结点引用
self.val: int = val # 节点值
self.height: int = 0 # 节点高度
self.left: TreeNode | None = None # 左子节点引用
self.right: TreeNode | None = None # 右子节点引用
def list_to_tree(arr: list[int]) -> TreeNode | None:
""" Generate a binary tree with a list """

4
codes/python/modules/linked_list.py
View File

@ -7,8 +7,8 @@ Author: Krahets (krahets@163.com)
class ListNode:
""" Definition for a singly-linked list node """
def __init__(self, val: int):
self.val: int = val # 结点值
self.next: ListNode | None = None # 后继结点引用
self.val: int = val # 节点值
self.next: ListNode | None = None # 后继节点引用
def list_to_linked_list(arr: list[int]) -> ListNode | None:
""" Generate a linked list with a list """