(self, node)
insert a new node assuming there are no repeated values
insert a new node assuming there are no repeated values
insert a new node assuming there are no repeated values
def insert(self, node):
        """ insert a new node assuming there are no repeated values"""
        curr = self.root
        while True:
            if node.val < curr.val:
                if curr.left is None:
                    curr.left = node
                    return
                curr = curr.left
            elif node.val > curr.val:
                if curr.right is None:
                    curr.right = node
                    return
                curr = curr.right
def insert ( self , node ) : curr = self . root while True : if node . val < curr . val : if curr . left is None : curr . left = node return curr = curr . left elif node . val > curr . val : if curr . right is None : curr . right = node return curr = curr . right