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

Fine tune

Browse Source
This commit is contained in:
Yudong Jin
2022-12-27 19:24:43 +08:00
parent c4d32621c3
commit dbb25003ec
5 changed files with 7 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/python/chapter_tree/binary_search_tree.py
View File

@ -12,15 +12,12 @@ from include import *
""" 二叉搜索树 """
class BinarySearchTree:
def __init__(self, nums: typing.List[int]) -> None:
nums.sort()
self.__root = self.build_tree(nums, 0, len(nums) - 1)
""" 构建二叉搜索树 """
def build_tree(self, nums: typing.List[int], start_index: int, end_index: int) -> typing.Optional[TreeNode]:
if start_index > end_index:
return None
@ -38,7 +35,6 @@ class BinarySearchTree:
return self.__root
""" 查找结点 """
def search(self, num: int) -> typing.Optional[TreeNode]:
cur = self.root
# 循环查找，越过叶结点后跳出
@ -55,7 +51,6 @@ class BinarySearchTree:
return cur
""" 插入结点 """
def insert(self, num: int) -> typing.Optional[TreeNode]:
root = self.root
# 若树为空，直接提前返回
@ -86,7 +81,6 @@ class BinarySearchTree:
return node
""" 删除结点 """
def remove(self, num: int) -> typing.Optional[TreeNode]:
root = self.root
# 若树为空，直接提前返回
@ -132,7 +126,6 @@ class BinarySearchTree:
return cur
""" 获取最小结点 """
def min(self, root: typing.Optional[TreeNode]) -> typing.Optional[TreeNode]:
if root is None:
return root
@ -143,6 +136,7 @@ class BinarySearchTree:
return root
""" Driver Code """
if __name__ == "__main__":
# 初始化二叉搜索树
nums = list(range(1, 16))