Python BinarySearchTree.breadth_first Examples

Example #1

File: test_tree.py Project: Bhattb2/data-structures-and-algorithms-1

def test_bst_breadth_first_2():
    bst = BinarySearchTree()
    bst.add(15)
    bst.add(10)
    bst.add(17)
    bst.add(9)
    bst.add(4)
    bst.add(6)
    bst.add(26)
    bst.add(25)
    assert bst.breadth_first() == [15, 10, 17, 9, 26, 4, 25, 6]

Example #2

File: test_tree.py Project: Bhattb2/data-structures-and-algorithms-1

def test_bst_breadth_first():
    bst = BinarySearchTree()
    bst.add(10)
    bst.add(8)
    bst.add(17)
    bst.add(23)
    bst.add(3)
    bst.add(-1)
    bst.add(50)
    bst.add(34)
    assert bst.breadth_first() == [10, 8, 17, 3, 23, -1, 50, 34]