  
  
  def insert(root, data):
      if root is None:
          root = Node(data)
          return root
      if data <= root.data:
          if root.left is None:
              root.left = insert(root.left, data)
 
</s> remove             root.left = Node(data)
 </s> add             root.left = insert(root.left, data) </s> remove             return root.left
 </s> add  </s> remove             return insert(root.left, data)
 </s> add             insert(root.left, data) </s> remove             root.right = Node(data)
 </s> add             root.right = insert(root.right, data)
    # Constraint: Assume we are working with valid ints
  
  
  def insert(root, data):
    # Constraint: Assume we are working with valid ints
      if root is None:
          root = Node(data)
          return root
      if data <= root.data:
          if root.left is None:
              root.left = insert(root.left, data)
keep keep add keep keep keep keep keep keep
 Polish bst challenge and solution (#75)

Update constraints, algorithm discussion, and code. 
graphs_trees/bst/bst.py