  		print("Test: insert checking with post order traversal")
  		expectVal = [7, 25, 10, 38, 40, 30, 60, 80, 70, 50]
  		assert_equal(myTree.printPostOrder(), expectVal)
  		expectVal = [91, 81, 71, 61, 51, 41, 31, 21, 11, 1]
  		assert_equal(myTree2.printPostOrder(), expectVal)
  
  
  		print("Test: insert checking with pre order traversal")
  		expectVal = [50, 30, 10, 7, 25, 40, 38, 70, 60, 80]
  		assert_equal(myTree.printPreOrder(), expectVal)
 
</s> remove 		assert_equal(myTree.printPostOrder(), expectVal)
 </s> add 		self.assertEqual(myTree.printPostOrder(), expectVal) </s> remove 		assert_equal(myTree2.printInOrder(), expectVal)
 </s> add 		self.assertEqual(myTree2.printInOrder(), expectVal) </s> remove 		assert_equal(myTree.printInOrder(), expectVal)
 </s> add 		self.assertEqual(myTree.printInOrder(), expectVal) </s> remove 		assert_equal(myTree.printPreOrder(), expectVal)
 </s> add 		self.assertEqual(myTree.printPreOrder(), expectVal) </s> remove 		assert_equal(myTree2.printPreOrder(), expectVal)
 </s> add 		self.assertEqual(myTree2.printPreOrder(), expectVal)
		self.assertEqual(myTree2.printPostOrder(), expectVal)
  		print("Test: insert checking with post order traversal")
  		expectVal = [7, 25, 10, 38, 40, 30, 60, 80, 70, 50]
  		assert_equal(myTree.printPostOrder(), expectVal)
  		expectVal = [91, 81, 71, 61, 51, 41, 31, 21, 11, 1]
		self.assertEqual(myTree2.printPostOrder(), expectVal)
  
  
  		print("Test: insert checking with pre order traversal")
  		expectVal = [50, 30, 10, 7, 25, 40, 38, 70, 60, 80]
  		assert_equal(myTree.printPreOrder(), expectVal)
keep keep keep keep replace keep keep keep keep keep
 #273: Remove nose dependency for staging/ (#283) 
staging/graphs_trees/binary_tree/test_binary_search_tree.py