Method insert

binary_search_tree.py:25–47

Creating a BST with root value as val

(self, val)

        self.root = None

    def insert(self, val):
        """Creating a BST with root value as val"""
        # Check if tree has root with None value
        if self.root is None:
            self.root = Node(val)
        # Here the tree already has one root
        else:
            current = self.root
            while True:
                if val < current.info:
                    if current.left:
                        current = current.left
                    else:
                        current.left = Node(val)
                        break
                elif val > current.info:
                    if current.right:
                        current = current.right
                    else:
                        current.right = Node(val)
                        break
                else:
                    break

    def search(self, val, to_delete=False):
        current = self.root