Python BinarySearchTree.traverse_in_order Examples

Example #1

File: test_more_trees_lab33.py Project: schoentr/data-structures-and-algorithms

def test_traverse_in_order():
    tree = BinarySearchTree()
    tree.add('bananas')
    tree.add('apples')
    tree.add('cucumbers')

    items = list(tree.traverse_in_order())

    assert items == ['apples', 'bananas', 'cucumbers']

Example #2

File: test_more_trees_lab33.py Project: schoentr/data-structures-and-algorithms

def test_traverse_for_loop_in_order():
    tree = BinarySearchTree()
    tree.add('bananas')
    tree.add('apples')
    tree.add('cucumbers')

    items = []

    for item in tree.traverse_in_order():
        items.append(item)

    assert items == ['apples', 'bananas', 'cucumbers']