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

Quicksort Algorithm and Data structure in PYTHON

So, now what is Quicksort ? Quicksort, or partition-exchange sort, is a sorting algorithm developed by Tony Hoare that, on average, makes O comparisons to sort n items. In the worst case, it makes O comparisons, though this behavior is rare. Quicksort is often faster in practice than other O algorithms. Additionally, quicksort's sequential and localized memory references work well with a cache. Quicksort is a comparison sort and, in efficient implementations, is not a stable sort. Quicksort can be implemented with an in-place partitioning algorithm, so the entire sort can be done with only O additional space used by the stack during the recursion. Properties of Quicksort :- The quick sort is an in-place, divide-and-conquer, massively recursive sort algorithm . The efficiency of the algorithm is majorly impacted by which element is chosen as the pivot point. The worst-case efficiency of the quick sort is o (n²) when the list is sorted and left most element is chosen as the p...

Basic Python Programs

Search This Blog