Method __init__

Tree/BinarySearchTree.py:29–34

(self, root)

    """

    def __init__(self, root):
        if isinstance(root, TreeNode):
            print(1)
            self.root = root
        else:
            self.root = TreeNode(root)

    def add(self, value):
        # 从顶点开始遍历，找寻其合适的位置。