-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path4.3.py
More file actions
48 lines (42 loc) · 1.03 KB
/
4.3.py
File metadata and controls
48 lines (42 loc) · 1.03 KB
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
data = {
"a": ["b","c"],
"b": ["d"],
"c": ["e", "f"],
"d": [],
"e": [],
"f": []
}
class NewNode:
def __init__(self, data):
self.data = data
class LinkedList:
def __init__(self, node):
self.head = node
self.next = None
def add (self, node):
current = self.head
while current != None:
current = current.next
current.next = node
# I don't feel like making a new linked list so I an array.
def bst_levels_linked_list (data, root):
current = root
que = [current, None]
levels = []
level = []
while len(que) > 0:
current = que.pop(0)
if current == None:
levels.append(level)
if len(que) > 0:
current = que.pop(0)
que.append(None)
level = []
else:
break
else:
for i in data[current]:
que.append(i)
level.append(current)
return levels
print(bst_levels_linked_list(data, "a"))