def test_remove_one(): lista = [18, 73, 98, 9] lista = [12, 54, 23, 54, 76, 4, 4, 32, 3, 25, 4657, 76, 57, 6, 545, 45, 3443, 4] avl_tree = AvlTree(lista) for elem in lista: print(elem) avl_tree.remove_value(elem)
def test_remove_list(): lista = [12, 54, 23, 54, 76, 4, 4, 32, 3, 25, 4657, 76, 57, 6, 545, 45, 3443, 4] listar = [[12, 54, 23], [54, 76], [4, 4], [32, 3, 25, 4657, 76], [57, 6, 545, 45, 3443, 4]] for elem in listar: avl_tree = AvlTree(lista) print(elem) avl_tree.remove_list(elem)
def test_search(): random.seed(1) random_list = random.sample(range(1, 100), 8) print(random_list) avl_tree = AvlTree(random_list) for elem in random_list: assert avl_tree.search_value(elem)
def test_remove_all2(): li = [12, 54, 23, 54, 76, 4, 4, 32, 3, 25, 4657, 76, 57, 6, 545, 45, 3443, 4] dele = [] tr = AvlTree(li) for elem in li: print(elem) if elem in dele: return else: dele.append(elem) tr.remove_value(elem)
def test_remove_all(): li = [1, 2, 3, 4, 5, 6, 7] dele = [] tr = AvlTree(li) for elem in li: print(elem) if elem in dele: return else: dele.append(elem) tr.remove_value(elem)
def test_add3(): lista = [18, 73, 98, 9] avl_tree = AvlTree(lista) avl_tree.add_node(AvlNode(33)) avl_tree.add_node(AvlNode(16)) avl_tree.add_node(AvlNode(64)) avl_tree.add_node(AvlNode(58)) avl_tree.print()
def test_remove(): test_tree = AvlTree([1, 2, 3, 4, 2, 8, 4, 12, 34, 9, 11]) length = len(test_tree.nodes) test_tree.remove_value(4) assert len(test_tree.nodes) == length - 1 length = len(test_tree.nodes) test_tree.remove_value(8) assert len(test_tree.nodes) == length - 1
def benchmark_wrapper(): avl_tree = AvlTree(random_list) return avl_tree
def test_trunk_value(): test_tree = AvlTree([1, 2, 3, 4]) test_tree.print() assert test_tree.trunk.value == 2 # test_tree.add_node(AvlNode(5)) test_tree = AvlTree([1, 2, 3, 4, 5]) test_tree.print() assert test_tree.trunk.value == 2 test_tree = AvlTree([1, 2, 3, 4, 5, 6]) test_tree.print() assert test_tree.trunk.value == 4
def test_search_all(): li = [1, 2, 3, 4, 5, 6, 7] tr = AvlTree(li) for elem in li: x = tr.search_value(elem) assert x.value == elem
def test_sum(): test_tree = AvlTree([1, 2, 3, 4]) assert len(test_tree.nodes) == 4 test_tree = AvlTree([1, 2, 3, 4, 2, 8, 4, 12, 34, 9, 11]) assert len(test_tree.nodes) == 11
def print_example_tree(): lista = [16, 8, 3, 5, 9, 10, 18, 4, 6, 1] avl_tree = AvlTree(lista) print("Input do drzewa: "+str(lista)) avl_tree.print()
def test_search_list(): lista = [12, 54, 23, 54, 76, 4, 4, 32, 3, 25, 4657, 76, 57, 6, 545, 45, 3443, 4] avl_tree = AvlTree(lista) for elem in lista: print(elem) avl_tree.search_value(elem)
def test_add2(): lista = [1, 7, 6, 5, 4, 2] avl_tree = AvlTree(lista) avl_tree.print()
def test_add(): lista = [1, 2, 3, 4, 5, 6] avl_tree = AvlTree(lista) avl_tree.print()