| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
Write a function, tree_levels, that takes in the root of a binary tree. The function should return a 2-Dimensional list where each sublist represents a level of the tree.
a = Node('a')
b = Node('b')
c = Node('c')
d = Node('d')
e = Node('e')
f = Node('f')
a.left = b
a.right = c
b.left = d
b.right = e
c.right = f
# a
# / \
# b c
# / \ \
# d e f
tree_levels(a) # ->
# [
# ['a'],
# ['b', 'c'],
# ['d', 'e', 'f']
# ]a = Node('a')
b = Node('b')
c = Node('c')
d = Node('d')
e = Node('e')
f = Node('f')
g = Node('g')
h = Node('h')
i = Node('i')
a.left = b
a.right = c
b.left = d
b.right = e
c.right = f
e.left = g
e.right = h
f.left = i
# a
# / \
# b c
# / \ \
# d e f
# / \ /
# g h i
tree_levels(a) # ->
# [
# ['a'],
# ['b', 'c'],
# ['d', 'e', 'f'],
# ['g', 'h', 'i']
# ]q = Node('q')
r = Node('r')
s = Node('s')
t = Node('t')
u = Node('u')
v = Node('v')
q.left = r
q.right = s
r.right = t
t.left = u
u.right = v
# q
# / \
# r s
# \
# t
# /
# u
# /
# v
tree_levels(q) # ->
# [
# ['q'],
# ['r', 's'],
# ['t'],
# ['u'],
# ['v']
# ]tree_levels(None) # -> []| Back | FazBrowse Home | New Git URL |