Esempi in Python per create_binary_tree

Esempio n. 1

def test_1():
    tree = create_binary_tree([0, -3, 5, -10, None, 9])
    assert (arr_to_tree([-10, -3, 0, 5, 9]) == tree)

Esempio n. 2

def test_2():
    tree = create_binary_tree([0, -10, 9, -20, -3, 5, 10])
    assert (arr_to_tree([-20, -10, -3, 0, 5, 9, 10]) == tree)

Esempio n. 3

File: max_depth_binary.py Progetto: sajjannagaraj/python-practice

def test_1():
    tree = create_binary_tree([3, 9, 20, None, None, 15, 7])
    print(tree)
    assert (max_depth(tree) == 3)

Esempio n. 4

File: valid_binary_search_tree.py Progetto: sajjannagaraj/python-practice

def test_4():
    tree = create_binary_tree([10, 5, 15, None, None, 6, 20])
    assert (is_valid_search_tree(tree) == False)

Esempio n. 5

File: symmetric.py Progetto: sajjannagaraj/python-practice

def test_2():
    tree = create_binary_tree([1, 2, 2, None, 3, None, 3])
    assert (is_symmetric(tree) == False)

Esempio n. 6

File: symmetric.py Progetto: sajjannagaraj/python-practice

def test_1():
    tree = create_binary_tree([1, 2, 2, 3, 4, 4, 3])
    assert (is_symmetric(tree) == True)

Esempio n. 7

File: level_order.py Progetto: sajjannagaraj/python-practice

def test_2():
    tree = create_binary_tree([1, 2, 2, None, 3, None, 3])
    assert (level_order(tree) == [[1], [2, 2], [3, 3]])

Esempio n. 8

File: level_order.py Progetto: sajjannagaraj/python-practice

def test_1():
    tree = create_binary_tree([3, 9, 20, None, None, 15, 7])
    assert (level_order(tree) == [[3], [9, 20], [15, 7]])

Esempio n. 9

def test_2():
    tree = create_binary_tree([1, 2, 3])
    result = serialize(tree)
    assert (deserialize(result) == tree)