def test_find_nontrivial_tree(self):
bst = BinarySearchTree()
data = [20, 50, 1, 150, 42]
for d in data:
bst.insert(d)
data.sort()
self.assertEqual(bst.toList(), data)
def test03_to_List(self):
binarytree = BinarySearchTree()
binarytree.setData(10)
binarytree.insert(17)
binarytree.insert(16)
binarytree.insert(14)
self.assertEqual(binarytree.toList(), [10, 14, 16, 17])
def test_find_single_tree(self):
bst = BinarySearchTree(10)
self.assertEqual(bst.toList(), [10])
def test_find_empty_tree(self):
bst = BinarySearchTree()
self.assertEqual(bst.toList(), [])
