          if root.left is None:
              root.left = insert(root.left, data)
              root.left.parent = root
          else:
              insert(root.left, data)
      else:
          if root.right is None:
              root.right = insert(root.right, data)
              root.right.parent = root
          else:
 
</s> remove     "            insert(root.left, data)\n",
 </s> add     "            return insert(root.left, data)\n", </s> remove     "            insert(root.right, data)"
 </s> add     "            return insert(root.right, data)" </s> remove     "        insert(node, 2)\n",
    "        insert(node, 8)\n",
    "        insert(node, 1)\n",
    "        insert(node, 3)\n",
 </s> add     "        assert_equal(insert(node, 2).data, 2)\n",
    "        assert_equal(insert(node, 8).data, 8)\n",
    "        assert_equal(insert(node, 1).data, 1)\n",
    "        assert_equal(insert(node, 3).data, 3)\n",
            return insert(root.left, data)
          if root.left is None:
              root.left = insert(root.left, data)
              root.left.parent = root
          else:
            return insert(root.left, data)
      else:
          if root.right is None:
              root.right = insert(root.right, data)
              root.right.parent = root
          else:
keep keep keep keep replace keep keep keep keep keep
 Update bst insert to return the inserted node (#81) 
graphs_trees/bst/bst.py