AVL tree addition and spin Python implementation

Crispy crisp 2020-11-14 16:22:33
avl tree addition spin python


from collections import deque
from dataStructures.tree.biTree.bst import BiTreeNode, BST
class AVLNode(BiTreeNode):
def __init__(self, data):
BiTreeNode.__init__(self, data)
self.bf = 0 # Survival balance factor
class AVLTree(BST):
def __init__(self, li=None):
BST.__init__(self, li)
def rotate_left(self, p, c):
#c It is the present. node,p yes node.parent
s2 = c.lchild
p.rchild = s2
if s2:
s2.parent = p
c.lchild = p
p.parent = c
p.bf = 0
c.bf = 0
return c
def rotate_right(self, p, c):
s2 = c.rchild
p.lchild = s2
if s2:
s2.parent = p
c.rchild = p
p.parent = c
p.bf = 0
c.bf = 0
return c
def rotate_right_left(self, p, c):
g = c.lchild
# First right , It becomes right and right
s3 = g.rchild
c.lchild = s3
if s3:
s3.parent = c
g.rchild = c
c.parent = g
s2 = g.lchild
p.rchild = s2
if s2:
s2.parent = p
g.lchild = p
p.parent = g
# to update bf( On the right - On the left )
# (1) Insert s3
if g.bf > 0:
p.bf = -1
c.bf = 0
# (2) Insert s2
elif g.bf < 0:
p.bf = 0
c.bf = 1
else: # What's inserted is g
p.bf = 0
c.bf = 0
# What's inserted is g( signify s1、s2、s3、s4 It's empty )
return g
def rotate_left_right(self, p, c):
g = c.rchild
s2 = g.lchild
c.rchild = s2
if s2:
s2.parent = c
g.lchild = c
c.parent = g
s3 = g.rchild
p.lchild = s3
if s3:
s3.parent = p
g.rchild = p
p.parent = g
# to update bf
if g.bf < 0: # Insert s2
p.bf = 1
c.bf = 0
elif g.bf > 0: # Insert s3
p.bf = 0
c.bf = -1
else:
p.bf = 0
c.bf = 0
return g
def insert_no_rec(self, val):
# 1. and BST equally , Insert
p = self.root
if not p: # Empty tree
self.root = AVLNode(val)
return
while True:
if val < p.data:
if p.lchild:
p = p.lchild # node Storage is the inserted node
else: # The left child doesn't exist
p.lchild = AVLNode(val)
p.lchild.parent = p
node = p.lchild # node What is stored is the inserted node
break
elif val > p.data:
if p.rchild:
p = p.rchild
else:
p.rchild = AVLNode(val)
p.rchild.parent = p
node = p.rchild
break
else: # val == p.data
return
# 2. to update balance factor
while node.parent: # node.parent Not empty
if node.parent.lchild == node: # The pass is from the left subtree , The left tree is even heavier
# to update node.parent Of bf -= 1
if node.parent.bf < 0: # original node.parent.bf == -1, After updating, it becomes -2
# Make a spin
# see node Which side is heavy
g = node.parent.parent # To connect the subtrees after rotation
x = node.parent # Root of subtree before rotation
# From the current node.bf Decide whether to insert left or right
if node.bf > 0:
n = self.rotate_left_right(node.parent, node) # n Is the head node of the subtree after rotation
else:
n = self.rotate_right(node.parent, node)
# Remember : hold n and g Connect
elif node.parent.bf > 0: # original node.parent.bf = 1, After updating, it becomes 0
node.parent.bf = 0
break
else: # original node.parent.bf = 0, After updating, it becomes -1
node.parent.bf = -1
node = node.parent
continue
else: # The pass is from the right subtree , The right tree is even heavier
# to update node.parent.bf += 1
if node.parent.bf > 0: # original node.parent.bf == 1, After updating, it becomes 2
# Make a spin
# see node Which side is heavy
g = node.parent.parent # To connect the subtrees after rotation
x = node.parent # Root of subtree before rotation
# From this we can judge whether it is the left subtree or the right subtree of the parent node
if node.bf < 0: # node.bf = -1
# Right left structure
n = self.rotate_right_left(node.parent, node)
else: # node.bf = 1
# Right right structure
n = self.rotate_left(node.parent, node)
# Remember to connect
elif node.parent.bf < 0: # original node.parent.bf = -1, After updating, it becomes 0
node.parent.bf = 0
break
else: # original node.parent.bf = 0, After updating, it becomes 1
node.parent.bf = 1
node = node.parent
continue
# Link the subtree after rotation
n.parent = g
if g: # g Not empty
# Judge whether it was the left child or the right child
if x == g.lchild:
g.lchild = n
else:
g.rchild = n
break
else:
self.root = n
break
def level_order(self, root):
queue = deque()
queue.append(root)
while len(queue) > 0:
node = queue.popleft()
print(node.data, end=',')
if node.lchild:
queue.append(node.lchild)
if node.rchild:
queue.append(node.rchild)
tree = AVLTree([10,5,0])
版权声明
本文为[Crispy crisp]所创,转载请带上原文链接,感谢

  1. 利用Python爬虫获取招聘网站职位信息
  2. Using Python crawler to obtain job information of recruitment website
  3. Several highly rated Python libraries arrow, jsonpath, psutil and tenacity are recommended
  4. Python装饰器
  5. Python实现LDAP认证
  6. Python decorator
  7. Implementing LDAP authentication with Python
  8. Vscode configures Python development environment!
  9. In Python, how dare you say you can't log module? ️
  10. 我收藏的有关Python的电子书和资料
  11. python 中 lambda的一些tips
  12. python中字典的一些tips
  13. python 用生成器生成斐波那契数列
  14. python脚本转pyc踩了个坑。。。
  15. My collection of e-books and materials about Python
  16. Some tips of lambda in Python
  17. Some tips of dictionary in Python
  18. Using Python generator to generate Fibonacci sequence
  19. The conversion of Python script to PyC stepped on a pit...
  20. Python游戏开发,pygame模块,Python实现扫雷小游戏
  21. Python game development, pyGame module, python implementation of minesweeping games
  22. Python实用工具,email模块,Python实现邮件远程控制自己电脑
  23. Python utility, email module, python realizes mail remote control of its own computer
  24. 毫无头绪的自学Python,你可能连门槛都摸不到!【最佳学习路线】
  25. Python读取二进制文件代码方法解析
  26. Python字典的实现原理
  27. Without a clue, you may not even touch the threshold【 Best learning route]
  28. Parsing method of Python reading binary file code
  29. Implementation principle of Python dictionary
  30. You must know the function of pandas to parse JSON data - JSON_ normalize()
  31. Python实用案例,私人定制,Python自动化生成爱豆专属2021日历
  32. Python practical case, private customization, python automatic generation of Adu exclusive 2021 calendar
  33. 《Python实例》震惊了,用Python这么简单实现了聊天系统的脏话,广告检测
  34. "Python instance" was shocked and realized the dirty words and advertisement detection of the chat system in Python
  35. Convolutional neural network processing sequence for Python deep learning
  36. Python data structure and algorithm (1) -- enum type enum
  37. 超全大厂算法岗百问百答(推荐系统/机器学习/深度学习/C++/Spark/python)
  38. 【Python进阶】你真的明白NumPy中的ndarray吗?
  39. All questions and answers for algorithm posts of super large factories (recommended system / machine learning / deep learning / C + + / spark / Python)
  40. [advanced Python] do you really understand ndarray in numpy?
  41. 【Python进阶】Python进阶专栏栏主自述:不忘初心,砥砺前行
  42. [advanced Python] Python advanced column main readme: never forget the original intention and forge ahead
  43. python垃圾回收和缓存管理
  44. java调用Python程序
  45. java调用Python程序
  46. Python常用函数有哪些?Python基础入门课程
  47. Python garbage collection and cache management
  48. Java calling Python program
  49. Java calling Python program
  50. What functions are commonly used in Python? Introduction to Python Basics
  51. Python basic knowledge
  52. Anaconda5.2 安装 Python 库(MySQLdb)的方法
  53. Python实现对脑电数据情绪分析
  54. Anaconda 5.2 method of installing Python Library (mysqldb)
  55. Python implements emotion analysis of EEG data
  56. Master some advanced usage of Python in 30 seconds, which makes others envy it
  57. python爬取百度图片并对图片做一系列处理
  58. Python crawls Baidu pictures and does a series of processing on them
  59. python链接mysql数据库
  60. Python link MySQL database