Binary Search Tree and Binary Heap in PYTHON

Here is the Python code for Binary Search Tree :-

Content included:-

1.) Insertion

2.) Search Operation

3.) Deletion

4.) Minimum Node

5.) Maximum Node

6.) Preorder Traversal

7.) InOrder Traversal

8.) PostOrder Traversal

class BST:
    def __init__(self, data):
        self.root = data
        self.left = None
        self.right =None

def insertnode(self, data):
        if self.root is None:
            self.root = data
            return

if self.root is data:
            return
        
        elif self.root > data:
            if self.left is not None:
                self.left.insertnode(data)
            else:
                self.left = BST(data)

elif self.root < data:
            if self.right is not None:
                self.right.insertnode(data)
            else:
                self.right = BST(data)

def searchoprn(self, data):
        if self.root is data:
            return print("Yes, the data is present.")
        
        elif self.root > data:
            if self.left is not None:
                self.left.searchoprn(data)
        
            else:
                print("Data is not present.")

elif self.root < data:
            if self.right is not None:
                self.right.searchoprn(data)
        
            else:
                print("Data is not present.")

def deletenode(self, data):
        if self.root is None:
            print('Tree is empty!')
            return
        if data < self.root:
            if self.left:
                self.left = self.left.deletenode(data)
            else:
                print("Node is already absent")
        elif data > self.root:
            if self.right:
                selfright = self.right.deletenode(data)
            else:
                print("Node is not present!")

else:
            if self.left is None:
                temp = self.right
                self = None
                return temp
            if self.right is None:
                temp = self.left
                self =None
                return temp
            
            node = self.right
            while node.left:
                node = node.left
            self.root = node.root
            self.right = self.right.deletenode(node, data)
        return self

def minnode(self):
        temp = self
        while temp.left:
            temp = temp.left
        print(temp.root)

def maxnode(self):
        temp = self
        while temp.right:
            temp = temp.right
        print(temp.root)

def preordertraverse(self):
        print(self.root, end=" - ")
        if self.left is not None:
            self.left.preordertraverse()
        if self.right is not None:
            self.right.preordertraverse()

def inordertraverse(self):
        if self.left:
            self.left.inordertraverse()
        print(self.root, end=" - ")
        
        if self.right:
            self.right.inordertraverse()

def postordertraverse(self):
        if self.left:
            self.left.postordertraverse()
        
        
        if self.right:
            self.right.postordertraverse()
        print(self.root, end=" - ")

new = BST(10)
new.insertnode(6)
new.insertnode(3)
new.insertnode(1)
new.insertnode(6)
new.insertnode(98)
new.insertnode(3)
new.insertnode(7)

print("Searching that Node 98 is present or not")
new.searchoprn(98)

print("\n")
new.deletenode(3)
print("Searching that Node 3 is present or not")
new.searchoprn(3)
print("\n")
print("Searching that Node 0 is present or not")
new.searchoprn(0)
print("\n")
print("Preorder")
new.preordertraverse()
print("\n")
print("inorder")
new.inordertraverse()
print("\n")
print("Postorder")
new.postordertraverse()

print("\n")
print("The minimum value in Tree is :-")
new.minnode()
print("\n")
print("The maximum value in the Tree is :-")
new.maxnode()

Now the code for Binary Heap is as follow :-

So this was the Python code for Binary Search Tree and Binary Heap with number of operations. Hope you understood this code. Please share it with your friends and help them learning Python.

John Veer

Contact mail id - john.veer.utube@gmail.com

Thanks for reading

print(" Bye! ")

www.basicpythonprogramme.blogspot.com

Bubble Sort Algorithm in PYTHON

What is Bubble Sort ? And why do we need this ? Bubble sort is the simplest algorithm to sort any array. Due to its simplicity, bubble sort is often used to introduce the concept of a sorting algorithm. In computer graphics it is popular for its capability to detect a very small error (like swap of just two elements) in almost-sorted arrays and fix it with just linear complexity (2n). For example, it is used in a polygon filling algorithm, where bounding lines are sorted by their x coordinate at a specific scan line (a line parallel to x axis) and with incrementing y their order changes . ALGORITHM :- 1.) Firstly we have an unsorted list, which is to be sorted. 2.) Consider the first element of the list. Then compare it with the next element. 3.) If the second element is greator than the first element than swap them. 4.) If the second element is smaller than the first element, then we don't have to do anything. 5.) Going ahead, now after swap (may or may not), look for second...

Basic Python Programs

Search This Blog