      "\t\tmyTree.insert(1)\n",
      "\t\tmyTree.insert(21)\n",
      "\n",
      "\t\tprint(\"Test: max node\")\n",
      "\t\tassert_equal(myTree.maxNode(), 21)\n",
      "\t\tmyTree.insert(32)\n",
      "\t\tassert_equal(myTree.maxNode(), 32)\n",
      "\n",
      "\t\tprint(\"Test: min node\")\n",
      "\t\tassert_equal(myTree.minNode(), 1)\n",
 
</s> remove     "\t\tassert_equal(myTree.maxNode(), 21)\n",
 </s> add     "\t\tself.assertEqual(myTree.maxNode(), 21)\n", </s> remove     "\t\tassert_equal(myTree.maxNode(), 32)\n",
 </s> add     "\t\tself.assertEqual(myTree.maxNode(), 32)\n", </s> remove     "\t\tassert_equal(myTree.maxNode(), 32)\n",
 </s> add     "\t\tself.assertEqual(myTree.maxNode(), 32)\n", </s> remove     "\t\tassert_equal(myTree.minNode(), 1)\n",
 </s> add     "\t\tself.assertEqual(myTree.minNode(), 1)\n", </s> remove     "\t\tassert_equal(myTree.minNode(), 1)\n",
 </s> add     "\t\tself.assertEqual(myTree.minNode(), 1)\n",
    "\t\tself.assertEqual(myTree.maxNode(), 21)\n",
      "\t\tmyTree.insert(1)\n",
      "\t\tmyTree.insert(21)\n",
      "\n",
      "\t\tprint(\"Test: max node\")\n",
    "\t\tself.assertEqual(myTree.maxNode(), 21)\n",
      "\t\tmyTree.insert(32)\n",
      "\t\tassert_equal(myTree.maxNode(), 32)\n",
      "\n",
      "\t\tprint(\"Test: min node\")\n",
      "\t\tassert_equal(myTree.minNode(), 1)\n",
keep keep keep keep replace keep keep keep keep keep
 #273: Remove nose dependency for staging/ (#283) 
staging/graphs_trees/binary_tree/binary_tree_challenge.ipynb