Scribd
Upload
13 views

Assignment No-4

The document provides an implementation of a Binary Search Tree (BST) in Python, including methods for inserting, removing, searching, and performing an inorder traversal of the tree. It defines two classes: BSTNode for individual nodes and BSTree for the overall tree structure. A simple menu-driven interface allows users to add, remove, and display the tree's elements.

Uploaded by

rosiriw830
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views

Assignment No-4

The document provides an implementation of a Binary Search Tree (BST) in Python, including methods for inserting, removing, searching, and performing an inorder traversal of the tree. It defines two classes: BSTNode for individual nodes and BSTree for the overall tree structure. A simple menu-driven interface allows users to add, remove, and display the tree's elements.

Uploaded by

rosiriw830
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Assignment No :4

// Binary Search Tree

class BSTNode:

def __init__(self, key):

self.key = key

self.left = None

self.right = None

self.parent = None

def insert(self, node):

if self.key > node.key:

if self.left is None:

self.left = node

node.parent = self

else:

self.left.insert(node)

elif self.key < node.key:

if self.right is None:

self.right = node

node.parent = self

else:

self.right.insert(node)

def inorder(self):

if self.left is not None:


self.left.inorder()

print(self.key, end=' ')

if self.right is not None:

self.right.inorder()

def replace_node_of_parent(self, new_node):

if self.parent is not None:

if new_node is not None:

new_node.parent = self.parent

if self.parent.left == self:

self.parent.left = new_node

elif self.parent.right == self:

self.parent.right = new_node

else:

self.key = new_node.key

self.left = new_node.left

self.right = new_node.right

if new_node.left is not None:

new_node.left.parent = self

if new_node.right is not None:

new_node.right.parent = self

def find_min(self):

current = self

while current.left is not None:


current = current.left

return current

def remove(self):

if (self.left is not None and self.right is not None):

successor = self.right.find_min()

self.key = successor.key

successor.remove()

elif self.left is not None:

self.replace_node_of_parent(self.left)

elif self.right is not None:

self.replace_node_of_parent(self.right)

else:

self.replace_node_of_parent(None)

def search(self, key):

if self.key > key:

if self.left is not None:

return self.left.search(key)

else:

return None

elif self.key < key:

if self.right is not None:

return self.right.search(key)

else:
return None

return self

class BSTree:

def __init__(self):

self.root = None

def inorder(self):

if self.root is not None:

self.root.inorder()

def add(self, key):

new_node = BSTNode(key)

if self.root is None:

self.root = new_node

else:

self.root.insert(new_node)

def remove(self, key):

to_remove = self.search(key)

if (self.root == to_remove

and self.root.left is None and self.root.right is None):

self.root = None

else:
to_remove.remove()

def search(self, key):

if self.root is not None:

return self.root.search(key)

bstree = BSTree()

print('Menu (this assumes no duplicate keys)')

print('add <key>')

print('remove <key>')

print('inorder')

print('quit')

while True:

do = input('What would you like to do? ').split()

operation = do[0].strip().lower()

if operation == 'add':

key = int(do[1])

bstree.add(key)

elif operation == 'remove':

key = int(do[1])

bstree.remove(key)
elif operation == 'inorder':

print('Inorder traversal: ', end='')

bstree.inorder()

print()

elif operation == 'quit':

break

Output

Menu (this assumes no duplicate keys)

add <key>

remove <key>

inorder

quit

What would you like to do? add 20

What would you like to do? add30

What would you like to do? add 50

What would you like to do? add 80

What would you like to do? add 9

What would you like to do? add 6

What would you like to do? inorder

Inorder traversal: 6 9 20 50 80

What would you like to do? remove 20

What would you like to do? inorder

Inorder traversal: 6 9 50 80

You might also like