data-structs-algorithms/bst.py at main · RamDanny/data-structs-algorithms · 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
class Node:
    def __init__(self, value=None, left=None, right=None):
        self.value = value
        self.left = left
        self.right = right

def insert_node(root, value):
    if value == root.value:
        return
    elif value < root.value:
        if root.left is not None:
            insert_node(root.left, value)
        else:
            new_node = Node(value)
            root.left = new_node
    else:
        if root.right is not None:
            insert_node(root.right, value)
        else:
            new_node = Node(value)
            root.right = new_node

def inorder(root):
    if root.left is not None:
        inorder(root.left)
    print(root.value, end=' ')
    if root.right is not None:
        inorder(root.right)

def levelorder(root):
    queue = []
    if root:
        queue.append(root)
    while len(queue) > 0:
        curr = queue.pop(0)
        print(curr.value, end=' ')
        if curr.left is not None:
            queue.append(curr.left)
        if curr.right is not None:
            queue.append(curr.right)


def main():
    root = Node(6)
    insert_node(root, 3)
    insert_node(root, 9)
    insert_node(root, 11)
    insert_node(root, 1)
    insert_node(root, 10)
    insert_node(root, 2)
    insert_node(root, 4)
    insert_node(root, 8)
    insert_node(root, 7)
    insert_node(root, 5)
    inorder(root)
    print()
    levelorder(root)

if __name__ == '__main__':
    main()