Function test_insertion_speed

data_structures/binary_tree/red_black_tree.py:560–567

Test that the tree balances inserts to O(log(n)) by doing a lot of them.

()

def test_insertion_speed() -> bool:
    """Test that the tree balances inserts to O(log(n)) by doing a lot
    of them.
    """
    tree = RedBlackTree(-1)
    for i in range(300000):
        tree = tree.insert(i)
    return True


def test_insert() -> bool: