Easy Learning Data Structures & Algorithms Python 3: Data Structures and Algorithms Guide in Python by yang hu

Author:yang hu [hu, yang]
Language: eng
Format: azw3
Published: 2019-05-21T16:00:00+00:00

@property

def root(self):

return self.__root

# Preorder traversal binary search tree

def preOrder(self, root):

if root == None:

return

print(root.data, ", ", end="")

self.preOrder(root.left) # Recursive Traversing the left subtree

self.preOrder(root.right) # Recursive Traversing the right subtree

def insert(self, node, new_data):

if self.__root == None:

self.__root = Node(new_data, None, None)

return

compareValue = new_data - node.data

#Recursive left subtree, continue to find the insertion position

if compareValue < 0:

if node.left == None:

node.left = Node(new_data, None, None)

else:

self.insert(node.left, new_data)

elif compareValue > 0: #Recursive right subtree, continue to find the insertion position

if node.right == None:

node.right = Node(new_data, None, None)

else:

self.insert(node.right, new_data)

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.