def test_balance(self): btree = BinarySearchTree(3) btree.insert(2) btree.insert(1) btree.insert(0) btree.insert(4) btree.insert(5) btree = btree.balance() self.assertEqual(btree.data, 2) self.assertEqual(btree.left.data, 0) self.assertEqual(btree.right.data, 4) self.assertEqual(btree.left.right.data, 1) self.assertEqual(btree.right.left.data, 3) self.assertEqual(btree.right.right.data, 5)
def test_balance(self): bst1 = BinarySearchTree() bst1.multiple_insert([1, 2, 3, 4, 5, 6, 7, 8]) bst1.balance() self.assertEqual(True, bst1.is_balanced()) bst2 = BinarySearchTree() bst2.multiple_insert([8, 7, 6, 5, 4, 3, 2, 1]) bst2.balance() self.assertEqual(True, bst2.is_balanced()) bst3 = BinarySearchTree() bst3.multiple_insert([10, 9, 11]) bst3.balance() self.assertEqual(True, bst3.is_balanced())