示例#1
0
def test_breadth_none(capsys):
    """No output."""
    a = BST()
    breadth_first_traversal(a)
    sys.stderr.write("")
    out, err = capsys.readouterr()
    assert out == err
示例#2
0
def test_breadth_unbalanced(capsys, tree):
    """Correct output order."""
    tree.insert(4)
    breadth_first_traversal(tree)
    sys.stderr.write("10\n5\n15\n3\n6\n11\n16\n4\n")
    out, err = capsys.readouterr()
    assert out == err
def test_normal_BFT_valid(bst_ten_values_random):
    """ tests normal behavior of function """
    assert breadth_first_traversal(bst_ten_values_random) == [5,3,10,1,4,7,12]
def test_bft_with_empty_tree(bst_empty):
    """ asserts good behavior with empty tree """
    assert breadth_first_traversal(bst_empty) == False
def test_bft_with_one_val(bst_one_val):
    """ asserts good behavior with tree that only has root """
    assert breadth_first_traversal(bst_one_val) == [5]
示例#6
0
def test_breadth_first_traversal():
    """Test the breadth first traversal"""
    tree = BST([2, 1, 3])
    assert breadth_first_traversal(tree) == [2, 1, 3]
示例#7
0
def test_breadth_first_traversal_right():
    """Test traversing the right side"""
    tree = BST([1, 3, 5, 7, 9])
    assert breadth_first_traversal(tree) == [1, 3, 5, 7, 9]
示例#8
0
def test_breadth_first_traversal_balanced():
    """Test a balanced tree"""
    tree = BST([10, 7, 3, 16, 12, 8, 20])
    assert breadth_first_traversal(tree) == [10, 7, 16, 3, 8, 12, 20]
示例#9
0
def test_breadth_first_traversal_empty_tree():
    """Test an empty tree"""
    tree = BST([])
    assert breadth_first_traversal(tree) == []
示例#10
0
def test_breadth_first_traversal_not_a_number():
    """Test with a value not a number"""
    tree = BST(['demi', 'scott'])
    assert breadth_first_traversal(tree) == ['demi', 'scott']
示例#11
0
def test_breadth_first_traversal_only_root():
    """Test with only a root node"""
    tree = BST([1])
    assert breadth_first_traversal(tree) == [1]
示例#12
0
def test_min_tree(small_bst):
    a = []
    breadth_first_traversal(small_bst, a.append)
    assert a == [4, 2, 5, 1, 3, 6, 7]
示例#13
0
def test_min_tree_(min_bst):
    a = []
    breadth_first_traversal(min_bst, a.append)
    assert a == [3, 1, 4]
示例#14
0
def test_empty_tree(empty_bst):
    a = []
    assert breadth_first_traversal(empty_bst, a.append) is False