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

refactor: Follow the PEP 585 Typing standard (#439)

Browse Source 
* Follow the PEP 585 Typing standard

* Update list.py
This commit is contained in:
Yudong Jin
2023-03-23 18:51:56 +08:00
committed by GitHub
parent f4e01ea32e
commit 8918ec9079
43 changed files with 256 additions and 342 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -4,25 +4,24 @@ Created Time: 2021-12-11
Author: Krahets (krahets@163.com)
"""
import collections
from typing import List, Deque, Optional
from collections import deque
class TreeNode:
""" Definition for a binary tree node """
def __init__(self, val: int = 0, left: Optional['TreeNode'] = None, right: Optional['TreeNode'] = None):
self.val: int = val # 结点值
self.height: int = 0 # 结点高度
self.left: Optional[TreeNode] = left # 左子结点引用
self.right: Optional[TreeNode] = right # 右子结点引用
def __init__(self, val: int = 0):
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]) -> Optional[TreeNode]:
def list_to_tree(arr: list[int]) -> TreeNode | None:
""" Generate a binary tree with a list """
if not arr:
return None
i: int = 0
root = TreeNode(arr[0])
queue: Deque[TreeNode] = collections.deque([root])
queue: deque[TreeNode] = deque([root])
while queue:
node: TreeNode = queue.popleft()
i += 1
@ -38,14 +37,14 @@ def list_to_tree(arr: List[int]) -> Optional[TreeNode]:
return root
def tree_to_list(root: Optional[TreeNode]) -> List[int]:
def tree_to_list(root: TreeNode | None) -> list[int]:
""" Serialize a tree into an array """
if not root: return []
queue: Deque[TreeNode] = collections.deque()
queue: deque[TreeNode] = deque()
queue.append(root)
res: List[int] = []
res: list[int] = []
while queue:
node: Optional[TreeNode] = queue.popleft()
node: TreeNode | None = queue.popleft()
if node:
res.append(node.val)
queue.append(node.left)
@ -53,12 +52,12 @@ def tree_to_list(root: Optional[TreeNode]) -> List[int]:
else: res.append(None)
return res
def get_tree_node(root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
def get_tree_node(root: TreeNode | None, val: int) -> TreeNode | None:
""" Get a tree node with specific value in a binary tree """
if not root:
return
if root.val == val:
return root
left: Optional[TreeNode] = get_tree_node(root.left, val)
right: Optional[TreeNode] = get_tree_node(root.right, val)
left: TreeNode | None = get_tree_node(root.left, val)
right: TreeNode | None = get_tree_node(root.right, val)
return left if left else right