python/tree_exs.py at master · addie/python · 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
from pprint import pprint as pp


def binary_tree(r=None):
   return [r, [], []]

def insert_left(root, new_branch):
   t = root.pop(1)
   if len(t) > 1:
      root.insert(1, [new_branch, t, []])
   else:
      root.insert(1, [new_branch, [], []])
   return root

def insert_right(root, new_branch):
   t = root.pop(2)
   if len(t) > 1:
      root.insert(2, [new_branch, [], t])
   else:
      root.insert(2, [new_branch, [], []])
   return root

def get_root_val(root):
   return root[0]

def set_root_val(root, new_val):
   root[0] = new_val

def get_left_child(root):
   return root[1]

def get_right_child(root):
   return root[2]

def build_tree(root):
	set_root_val(root,'a')
	insert_left(root,'b')
	insert_right(root,'c')
	insert_right(get_left_child(root),'d')
	insert_left(get_right_child(root),'e')
	insert_right(get_right_child(root),'f')
	return root

if __name__=="__main__":
	r = binary_tree()
	pp(build_tree(r))