Example #1
0
def test_remove_internal():
    bst = make_tree()
    pre = bst.preorder()
    i = pre.index(Pair('g'))
    bst.remove(Pair('g'))
    pre = bst.preorder()
    assert pre[i] == Pair('f')
Example #2
0
def test_postorder():
    bst = make_tree()
    assert bst.postorder()[27] == Pair('W', 13)
Example #3
0
def test_inorder():
    bst = make_tree()
    assert bst.inorder()[27] == Pair('T', 34)
Example #4
0
def test_preorder():
    bst = make_tree()
    assert bst.preorder()[27] == Pair('R', 20)
Example #5
0
def test_remove_leaf():
    bst = make_tree()
    bst.remove(Pair('z'))
    pre = bst.preorder()
    assert pre[-1] == Pair('w')
Example #6
0
def test_tree_height():
    bst = make_tree()
    assert bst.height() == 11
Example #7
0
def test_remove_root():
    bst = make_tree()
    bst.remove(Pair('C'))
    pre = bst.preorder()
    assert pre[0] == Pair('D')
Example #8
0
def test_tree_size():
    bst = make_tree()
    assert bst.size() == 57
Example #9
0
def test_rebalance():
    bst = make_tree()
    original_height = bst.height()
    tree_data = bst.rebalance()
    assert not original_height == bst.height()
Example #10
0
def test_postorder():
    bst = make_tree()
    assert bst.postorder()[27] == 'W'
Example #11
0
def test_inorder():
    bst = make_tree()
    assert bst.inorder()[27] == 'T'
Example #12
0
def test_preorder():
    bst = make_tree()
    assert bst.preorder()[27] == 'R'