Python BinarySearchTree.insert Examples

Example #1

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_query_node_9_after_insert_10_and_9(self):
     bst = BinarySearchTree()
     bst.insert(10)
     bst.insert(9)
     answer = bst.query(9)
     self.assertEquals(answer.value, 9)
     self.assertEquals(answer, bst.root.left)

Example #2

 def test_bst_query_node_8_after_insert_7_and_8(self):
     bst = BinarySearchTree()
     bst.insert(7)
     bst.insert(8)
     answer = bst.query(8)
     self.assertEquals(answer.value, 8)
     self.assertEquals(answer, bst.root.right)

Example #3

 def test_bst_insert_one_node(self):
     bst = BinarySearchTree()
     bst.insert(1)
     self.assertEquals(bst.root.value, 1)
     self.assertEquals(bst.root.right, None)
     self.assertEquals(bst.root.left, None)
     self.assertEquals(bst.size, 1)

Example #4

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_query_node_8_after_insert_7_and_8(self):
     bst = BinarySearchTree()
     bst.insert(7)
     bst.insert(8)
     answer = bst.query(8)
     self.assertEquals(answer.value, 8)
     self.assertEquals(answer, bst.root.right)

Example #5

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_insert_one_node(self):
     bst = BinarySearchTree()
     bst.insert(1)
     self.assertEquals(bst.root.value, 1)
     self.assertEquals(bst.root.right, None)
     self.assertEquals(bst.root.left, None)
     self.assertEquals(bst.size, 1)

Example #6

 def test_bst_query_node_9_after_insert_10_and_9(self):
     bst = BinarySearchTree()
     bst.insert(10)
     bst.insert(9)
     answer = bst.query(9)
     self.assertEquals(answer.value, 9)
     self.assertEquals(answer, bst.root.left)

Example #7

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_remove_root_from_tree_with_larger_leaf(self):
     bst = BinarySearchTree()
     bst.insert(23)
     bst.insert(24)
     root = bst.remove(23)
     self.assertEquals(root.value, 24)
     self.assertEquals(bst.height, 1)
     self.assertEquals(bst.size, 1)

Example #8

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_remove_larger_leaf_from_tree_with_2(self):
     bst = BinarySearchTree()
     bst.insert(19)
     bst.insert(20)
     root = bst.remove(20)
     self.assertEquals(root.value, 19)
     self.assertEquals(bst.height, 1)
     self.assertEquals(bst.size, 1)

Example #9

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_remove_smaller_leaf_from_tree_with_2(self):
     bst = BinarySearchTree()
     bst.insert(18)
     bst.insert(17)
     root = bst.remove(17)
     self.assertEquals(root.value, 18)
     self.assertEquals(bst.height, 1)
     self.assertEquals(bst.size, 1)

Example #10

 def test_bst_insert_nodes_4_and_3(self):
     bst = BinarySearchTree()
     bst.insert(4)
     bst.insert(3)
     self.assertEquals(bst.root.value, 4)
     self.assertEquals(bst.root.left.value, 3)
     self.assertEquals(bst.root.right, None)
     self.assertEquals(bst.size, 2)

Example #11

 def test_bst_remove_larger_leaf_from_tree_with_2(self):
     bst = BinarySearchTree()
     bst.insert(19)
     bst.insert(20)
     root = bst.remove(20)
     self.assertEquals(root.value, 19)
     self.assertEquals(bst.height, 1)
     self.assertEquals(bst.size, 1)

Example #12

 def test_bst_remove_smaller_leaf_from_tree_with_2(self):
     bst = BinarySearchTree()
     bst.insert(18)
     bst.insert(17)
     root = bst.remove(17)
     self.assertEquals(root.value, 18)
     self.assertEquals(bst.height, 1)
     self.assertEquals(bst.size, 1)

Example #13

 def test_bst_remove_root_from_tree_with_larger_leaf(self):
     bst = BinarySearchTree()
     bst.insert(23)
     bst.insert(24)
     root = bst.remove(23)
     self.assertEquals(root.value, 24)
     self.assertEquals(bst.height, 1)
     self.assertEquals(bst.size, 1)

Example #14

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_insert_nodes_4_and_3(self):
     bst = BinarySearchTree()
     bst.insert(4)
     bst.insert(3)
     self.assertEquals(bst.root.value, 4)
     self.assertEquals(bst.root.left.value, 3)
     self.assertEquals(bst.root.right, None)
     self.assertEquals(bst.size, 2)

Example #15

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_insert_nodes_1_and_2(self):
     bst = BinarySearchTree()
     bst.insert(1)
     bst.insert(2)
     self.assertEquals(bst.root.value, 1)
     self.assertEquals(bst.root.right.value, 2)
     self.assertEquals(bst.root.left, None)
     self.assertEquals(bst.size, 2)

Example #16

 def test_bst_insert_nodes_1_and_2(self):
     bst = BinarySearchTree()
     bst.insert(1)
     bst.insert(2)
     self.assertEquals(bst.root.value, 1)
     self.assertEquals(bst.root.right.value, 2)
     self.assertEquals(bst.root.left, None)
     self.assertEquals(bst.size, 2)

Example #17

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_remove__single_tree_item(self):
     bst = BinarySearchTree()
     bst.insert(16)
     root = bst.remove(16)
     was_found = bst.query(16)
     self.assertEquals(root, None)
     self.assertEquals(was_found, False)
     self.assertEquals(bst.height, 0)
     self.assertEquals(bst.size, 0)

Example #18

 def test_bst_remove__single_tree_item(self):
     bst = BinarySearchTree()
     bst.insert(16)
     root = bst.remove(16)
     was_found = bst.query(16)
     self.assertEquals(root, None)
     self.assertEquals(was_found, False)
     self.assertEquals(bst.height, 0)
     self.assertEquals(bst.size, 0)

Example #19

 def test_bst_remove_root_with_left_and_right_children(self):
     bst = BinarySearchTree()
     bst.insert(29)
     bst.insert(28)
     bst.insert(30)
     root = bst.remove(29)
     self.assertEquals(bst.size, 2)
     self.assertEquals(root.value, 28)
     self.assertEquals(root.right.value, 30)
     self.assertEquals(root.left, None)

Example #20

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_remove_root_with_left_and_right_children(self):
     bst = BinarySearchTree()
     bst.insert(29)
     bst.insert(28)
     bst.insert(30)
     root = bst.remove(29)
     self.assertEquals(bst.size, 2)
     self.assertEquals(root.value, 28)
     self.assertEquals(root.right.value, 30)
     self.assertEquals(root.left, None)

Example #21

 def test_bst_remove_all_items_of_balanced_tree_with_3_items(self):
     bst = BinarySearchTree()
     bst.insert(26)
     bst.insert(25)
     bst.insert(27)
     bst.remove(27)
     bst.remove(25)
     root = bst.remove(26)
     self.assertEquals(root, None)
     self.assertEquals(bst.height, 0)
     self.assertEquals(bst.size, 0)

Example #22

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_remove_all_items_of_balanced_tree_with_3_items(self):
     bst = BinarySearchTree()
     bst.insert(26)
     bst.insert(25)
     bst.insert(27)
     bst.remove(27)
     bst.remove(25)
     root = bst.remove(26)
     self.assertEquals(root, None)
     self.assertEquals(bst.height, 0)
     self.assertEquals(bst.size, 0)

Example #23

 def test_bst_height_3(self):
     bst = BinarySearchTree()
     bst.insert(12)
     bst.insert(13)
     bst.insert(14)
     self.assertEquals(bst.height, 3)

Example #24

 def test_bst_to_string_tree_with_1_node(self):
     bst = BinarySearchTree()
     bst.insert(1)
     printlines = bst.to_string(bst.root)
     self.assertEquals(printlines, TREE_WITH_1)

Example #25

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_query_node_6_after_insert(self):
     bst = BinarySearchTree()
     bst.insert(6)
     answer = bst.query(6)
     self.assertEquals(answer, bst.root)

Example #26

 def test_bst_query_node_6_after_insert(self):
     bst = BinarySearchTree()
     bst.insert(6)
     answer = bst.query(6)
     self.assertEquals(answer, bst.root)

Example #27

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_height_3(self):
     bst = BinarySearchTree()
     bst.insert(12)
     bst.insert(13)
     bst.insert(14)
     self.assertEquals(bst.height, 3)

Example #28

 def test_bst_height_2_three_nodes(self):
     bst = BinarySearchTree()
     bst.insert(15)
     bst.insert(14)
     bst.insert(16)
     self.assertEquals(bst.height, 2)

Example #29

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_height_2_two_nodes(self):
     bst = BinarySearchTree()
     bst.insert(12)
     bst.insert(13)
     self.assertEquals(bst.height, 2)

Example #30

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_to_string_tree_with_1_node(self):
     bst = BinarySearchTree()
     bst.insert(1)
     printlines = bst.to_string(bst.root)
     self.assertEquals(printlines, TREE_WITH_1)

Example #31

 def test_bst_height_2_two_nodes(self):
     bst = BinarySearchTree()
     bst.insert(12)
     bst.insert(13)
     self.assertEquals(bst.height, 2)

Example #32

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_height_2_three_nodes(self):
     bst = BinarySearchTree()
     bst.insert(15)
     bst.insert(14)
     bst.insert(16)
     self.assertEquals(bst.height, 2)

Example #33

 def test_bst_height_1(self):
     bst = BinarySearchTree()
     bst.insert(11)
     self.assertEquals(bst.height, 1)

Example #34

File: test_data_structures.py Project: ankur17/algorithms

 def test_bst_height_1(self):
     bst = BinarySearchTree()
     bst.insert(11)
     self.assertEquals(bst.height, 1)