#Node is defined as
#self.left (the left child of the node)
#self.right (the right child of the node)
#self.info (the value of the node)

    def insert(self, val):
        node = self.root #Accessing root node
        if node is None: #Checking if first node is empty or not
            self.root = Node(val)
            return node #self.root
        while node is not None:#condition true if node is not none
            if val > node.info:#if given value is greater than node info value
                if node.right is None:#if right sub tree of the node is empty
                    node.right = Node(val)
                    return
                node = node.right
            else:
                if node.left is None:#if left sub tree of the node is empty
                    node.left = Node(val)
                    return 
                node = node.left
        return node