99_problems/p55.py at main · Luki248/99_problems · 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
#!/usr/bin/env python3

import p26
import p54A

SYMBOl = "x"

# 0: [SYMBOl, None, None]
# 1: [SYMBOl, []  , None]
# 2: [SYMBOl, None, []  ]
# 3: [SYMBOl, [],   []  ]


def generate_permutations(list):
    return p26.heap_algorithm(len(list), list)

def complete_balanced_tree(list, k):
    ret = []
    if k > 1:
        ret.append([SYMBOl, complete_balanced_tree(list[:k-1][0], k-1), None])
        ret.append([SYMBOl, None, complete_balanced_tree(list[:k-1][0], k-1)])
        ret.append([SYMBOl, complete_balanced_tree(list[:k-1][0], k-2), complete_balanced_tree(list[:k-1][0], k-2)])
        return ret
    return list


# P55: Construct completely balanced binary trees.
def p55(k):
    nodes = k*[[SYMBOl, None, None]]

    return complete_balanced_tree(nodes, k)
    if list == None:
        return True
    if list == []:
        return False
    else:
        return False


if __name__ == "__main__":
    ret = p55(3)
    print(ret)


    for btree in ret:
        print(btree, p54A.p54A(btree))