-
Notifications
You must be signed in to change notification settings - Fork 4
/
nodesAtDistanceKFromRoot.py
52 lines (45 loc) · 1.27 KB
/
nodesAtDistanceKFromRoot.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
from Tree.commons import insert
def print_K_distant_v1(root, k):
if root is None:
return
if k == 0:
print(root.key, end=',')
else:
print_K_distant_v1(root.left, k - 1)
print_K_distant_v1(root.right, k - 1)
def print_K_distant_v2(root, k, distance=-1):
if root is None:
return
distance += 1
if distance == k:
print(root.key, end=',')
print_K_distant_v2(root.left, k, distance)
print_K_distant_v2(root.right, k, distance)
# 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)
k = 2
print ("\n----- Using V1 -----\n")
print ("Nodes at distance {distance} from root({root} are - )".format(distance=k, root=root.key))
print_K_distant_v1(root, k)
print ("\n----- Using V1 -----\n")
print ("Nodes at distance {distance} from root({root} are - )".format(distance=k, root=root.key))
print_K_distant_v2(root, k)