class TreeTestCase(unittest2.TestCase):
def setUp(self):
self.tree = Tree(Node(9))
def tearDown(self):
self.tree = None
def test_find_node(self):
self.assertTrue(self.tree.find_node(9), self.tree.root)
self.assertFalse(self.tree.find_node(1), self.tree.root)
self.assertFalse(self.tree.find_node(15), self.tree.root)
def test_contains(self):
self.assertFalse(self.tree.contains(1))
self.assertFalse(self.tree.contains(15))
def test_insert(self):
self.tree.insert(Node(6))
self.assertTrue(self.tree.contains(6))
def test_delete(self):
self.tree.insert(Node(13))
self.tree.insert(Node(7))
self.assertTrue(self.tree.delete(13)) # leaf
self.assertTrue(self.tree.delete(7))
self.assertFalse(self.tree.delete(13))
self.tree.insert(Node(13))
self.tree.insert(Node(12))
self.assertFalse(self.tree.delete(13))
def test_find_smaller(self):
self.tree.insert(Node(4))
self.tree.insert(Node(2))
self.tree.insert(Node(6))
self.tree.insert(Node(15))
self.assertEqual([node.val for node in self.tree.find_smaller(9)], [4, 2, 6])
def test_find_bigger(self):
self.tree.insert(Node(22))
self.tree.insert(Node(18))
self.tree.insert(Node(25))
self.assertEqual([node.val for node in self.tree.find_bigger(9)], [22, 25, 18])
def test_find_min(self):
self.tree.insert(Node(2))
self.tree.insert(Node(18))
self.tree.insert(Node(4))
self.assertEqual(self.tree.find_min().val, 2)
def test_find_max(self):
self.tree.insert(Node(2))
self.tree.insert(Node(18))
self.tree.insert(Node(4))
self.tree.insert(Node(13))
self.assertEqual(self.tree.find_max().val, 18)
def test_preorder_traverse(self):
self.tree.insert(Node(6))
self.tree.insert(Node(22))
self.tree.insert(Node(1))
self.tree.insert(Node(4))
self.tree.insert(Node(2))
self.tree.insert(Node(18))
self.assertEqual([node.val for node in self.tree.preorder_traverse()], [9, 6, 1, 4, 2, 22, 18])
def test_inorder_traverse(self):
self.tree.insert(Node(6))
self.tree.insert(Node(22))
self.tree.insert(Node(1))
self.tree.insert(Node(4))
self.tree.insert(Node(2))
self.tree.insert(Node(18))
self.assertEqual([node.val for node in self.tree.inorder_traverse()], [1, 2, 4, 6, 9, 18, 22])
def test_postorder_traverse(self):
self.tree.insert(Node(6))
self.tree.insert(Node(22))
self.tree.insert(Node(1))
self.tree.insert(Node(4))
self.tree.insert(Node(2))
self.tree.insert(Node(18))
self.assertSequenceEqual([node.val for node in self.tree.postorder_traverse()], [2, 4, 1, 6, 18, 22, 9])
