binarytrees/invokeBT.py at master · adwaraka/binarytrees · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
from binaryTree import (
    Node,
    insert,
    inorder,
    preorder,
    isIdentical,
    isSymmetricTree,
    minDepth,
    maxDepth,
    diameterOfBinaryTree,
    printRightSide,
    flipBinaryTree,
    printLevelOrder,
    countLeaves,
    invertBinaryTree,
)

def main():
    import random
    L = range(100)
    amount = 5
    inputArr = [random.choice(L) for _ in range(amount)]
    print(inputArr)
    root = Node(inputArr[0])
    for val in inputArr[1:]:
        insert(root, Node(val))
    inorder(root)
    print()
    preorder(root)
    dupArr = inputArr
    print()
    dupRoot = Node(dupArr[0])
    for val in dupArr[1:]:
        insert(dupRoot, Node(val))
    print(isIdentical(root, dupRoot))
    # TODO; better testing for symmetry
    print(isSymmetricTree(root))
    print(minDepth(root))
    print(maxDepth(root))
    print()
    print("rootD")
    rootD = Node(1)
    rootD.left = Node(2)
    rootD.right = Node(3)
    rootD.left.left = Node(4)
    rootD.left.right = Node(5)
    rootD.left.left.left = Node(6)
    #
    #            1
    #          /   \
    #        2       3
    #       /  \
    #     4     5
    #    /
    #  6
    #
    # inorder(rootD)
    print(f"Diameter: {diameterOfBinaryTree(rootD)}")
    print(f"The number of leaf nodes: {countLeaves(rootD)}")
    printRightSide(rootD)

    print()
    print("rootS")
    rootS = Node(1)
    rootS.left = Node(2)
    rootS.right = Node(3)
    rootS.right.left = Node(4)
    rootS.right.right = Node(5)
    print("Flipped")
    rootS = flipBinaryTree(rootS)
    printLevelOrder(rootS)

    print()
    print("rootI")
    rootI = Node(1)
    rootI.left = Node(2)
    rootI.right = Node(3)
    rootI.right.left = Node(4)
    rootI.right.right = Node(5)
    print(rootI.left.data)
    print(rootI.right.data)
    print("Inverted BT")
    invertBinaryTree(rootI)
    print(rootI.left.data)
    print(rootI.right.data)


if __name__ == "__main__":
    main()