Write Python program for inserting an element into binary tree.

Code:

 

class Node:

    def __init__(self, data):

        self.left = None

        self.right = None

        self.data = data

    def insert(self, data):

        if self.data:

            if data < self.data:

                if self.left is None:

                    self.left = Node(data)

                else:

                    self.left.insert(data)

            elif data > self.data:

                if self.right is None:

                    self.right = Node(data)

                else:

                    self.right.insert(data)

        else:

            self.data = data

    def PrintTree(self):

        if self.left:

            self.left.PrintTree()

        print( self.data),

        if self.right:

            self.right.PrintTree()

root = Node(20)

root.insert(11)

root.insert(25)

root.insert(10)

root.insert(30)

root.insert(19)

root.PrintTree()

 

O/p:-

Fundamental of algorithm