使用Python实现二叉搜索树的类
二叉树最基本的几个方法:
- 创建
- 插入数字
- 删除数字
在此基础上增加健壮性
- KeyError提示功能
- 使用属性装饰器让类更便利
- 通过 __str__魔法方法 中序遍历输出二叉树
此类同样可以被二叉搜索树继承
class BinaryTree:
'''
BinaryTree class
'''
#定义node子类
class Node:
def __init__(self,num):
self.val = num
self.left = None
self.right = None
#初始化类
def __init__(self,num):
self.head = self.Node(num)
#返回root
@property
def root(self):
return self.head
#增加元素的方法
def add(self,num):
cur = self.head
while True:
if cur.val > num:
if not cur.left:
cur.left = self.Node(num)
return
else:
cur = cur.left
if cur.val < num:
if not cur.right:
cur.right = self.Node(num)
return
else:
cur = cur.right
else:
raise ValueError('number is already exists')
#删除元素的方法
def delete(self,num):
def deleteNode(node):
if not node.left:
return node.right
if not node.right:
return node.left
cur = node.right
while cur.left:
cur = cur.left
cur.left = node.left
return node.right
def aux(root):
if not root:
return None
if root.val == num:
self.flag = 1
return deleteNode(root)
root.left = aux(root.left)
root.right = aux(root.right)
return root
self.flag = 0
self.head = aux(self.head)
if self.flag == 0:
raise ValueError('number not exists')
#打印元素的方法
def __str__(self):
def aux(root):
if not root:
return ''
return aux(root.left) + str(root.val) + ' ' + aux(root.right)
return aux(self.head)
Tree = BinaryTree(5)
Tree.add(3)
Tree.add(6)
Tree.add(3)
>>>
ValueError: number is already exists
Tree.add(1000)
Tree.delete(5)
Tree.delete(100)
>>>
ValueError: number not exists
print(Tree)
3 6 1000
>>>