题目链接: https://leetcode-cn.com/problems/binary-tree-level-order-traversal/comments/.
自己的版本:
class Solution(object):
def levelOrder(self, root):
"""
:type root: TreeNode
:rtype: List[List[int]]
"""
if not root:
return []
result = []
queue = [(root, 1)]
while len(queue) > 0:
curr = queue.pop(0)
if curr[1] > len(result):
result.append([curr[0].val])
else:
result[-1].append(curr[0].val)
if curr[0].left:
queue.append((curr[0].left, curr[1] + 1))
if curr[0].right:
queue.append((curr[0].right, curr[1] + 1))
return result
在Queue中携带了一个层高信息用于进行遍历
版本二:
class Solution(object):
def levelOrder(self, root):
"""
:type root: TreeNode
:rtype: List[List[int]]
"""
if not root:
return []
result = []
queue = [root]
while len(queue) > 0:
tmp = []
queue_size = len(queue)
for i in range(queue_size):
tmp_node = queue.pop(0)
tmp.append(tmp_node.val)
if tmp_node.left:
queue.append(tmp_node.left)
if tmp_node.right:
queue.append(tmp_node.right)
result.append(tmp)
return result
这个版本借助了BFS的特点,每一次的迭代,Queue中所存在的node,均在同一层。
对于一个满二叉树(节点数为2^n - 1的完全二叉树),Queue的每一次迭代过程如下:
[t0]
[t1, t2]
[t3, t4, t5, t6]
…