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

keep keep keep keep replace
 Updated bst to keep track of its parent and to return the node it inserts. 
graphs_trees/bst/bst.py