Python BinarySearchTree.items_pre_order Examples

Example #1

File: test_binary_tree.py Project: juliehutchinson001/cs3_data_struct

 def test_items_pre_order_with_7_numbers(self):
     # Create a complete binary search tree of 7 items in level-order
     items = [4, 2, 6, 1, 3, 5, 7]
     tree = BinarySearchTree(items)
     # Ensure the pre-order traversal of tree items is ordered correctly
     assert tree.items_pre_order() == [4, 2, 1, 3, 6, 5, 7]

Example #2

File: test_binary_tree.py Project: juliehutchinson001/cs3_data_struct

 def test_items_pre_order_with_3_strings(self):
     # Create a complete binary search tree of 3 strings in level-order
     items = ['B', 'A', 'C']
     tree = BinarySearchTree(items)
     # Ensure the pre-order traversal of tree items is ordered correctly
     assert tree.items_pre_order() == ['B', 'A', 'C']