          self.left = None
          self.right = None
  
  def insert(root, data):
      if data <= root.data:
          if root.left is None:
              root.left = Node(data)
          else:
 
</s> remove     "        visit_func(node.data)\n",
 </s> add     "        visit_func(node)\n",
    def __str__(self):
        return str(self.data)


          self.left = None
          self.right = None
  
    def __str__(self):
        return str(self.data)


  def insert(root, data):
      if data <= root.data:
          if root.left is None:
              root.left = Node(data)
          else:
keep keep add keep keep keep keep keep
 Simplified challenge coding and unit tests by working with the node directly as opposed to node.id or node.data, which is more natural when writing coding challenges. 
graphs_trees/bst/bst.py