-
Notifications
You must be signed in to change notification settings - Fork 4
/
allPathsRootToLeaves.py
69 lines (61 loc) · 1.85 KB
/
allPathsRootToLeaves.py
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
from Tree.commons import insert, print_tree, is_leaf
from copy import deepcopy
def all_paths_root_to_leaves_v1(root):
if root == None:
return
all_paths_root_to_leaves_v1.paths.append(root.key)
all_paths_root_to_leaves_v1(root.left)
if is_leaf(root):
print(all_paths_root_to_leaves_v1.paths)
all_paths_root_to_leaves_v1(root.right)
all_paths_root_to_leaves_v1.paths.pop()
def all_paths_root_to_leaves_v2(root, path, path_len):
if root == None:
return
path[path_len] = root.key
path_len += 1
if is_leaf(root):
for i in range(0, path_len):
print(path[i], end=',')
print('\n')
else:
all_paths_root_to_leaves_v2(root.left, path, path_len)
all_paths_root_to_leaves_v2(root.right, path, path_len)
def all_paths_root_to_leaves_v3(root, path = []):
if root is None: return
path.append(root.key)
if is_leaf(root):
for elt in path:
print(elt, end=',')
print('\n')
else:
all_paths_root_to_leaves_v3(root.left, deepcopy(path))
all_paths_root_to_leaves_v3(root.right, deepcopy(path))
# Driver program to test above function
if __name__ == "__main__":
""" Let us create following BST
50
/ \
30 70
/ \ / \
20 40 60 80
/ \
15 25
"""
root = None
root = insert(root, 50)
insert(root, 30)
insert(root, 20)
insert(root, 15)
insert(root, 25)
insert(root, 40)
insert(root, 70)
insert(root, 60)
insert(root, 80)
print("\n-------- Using v1 ---------\n")
all_paths_root_to_leaves_v1.paths = []
all_paths_root_to_leaves_v1(root)
print("\n-------- Using v2 ---------\n")
all_paths_root_to_leaves_v2(root, [None] * 20, 0)
print("\n-------- Using v3 ---------\n")
all_paths_root_to_leaves_v3(root)