题目 Binary Tree Level Order Traversal

层次遍历二叉树
链接
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],

3
/ \
9 20
/ \
15 7

return its level order traversal as:

[
[3],
[9,20],
[15,7]
]

解答

my answer

class Solution:def levelOrder(self, root):""":type root: TreeNode:rtype: List[List[int]]"""res, level = [], [root]while root and level:currentNode = []nextLevel = []for node in level:currentNode.append(node.val)if node.left:nextLevel.append(node.left)if node.right:nextLevel.append(node.right)res.append(currentNode)level = nextLevelreturn res

python 解法2

class Solution:# 返回从上到下每个节点值列表，例：[1,2,3]def PrintFromTopToBottom(self, root):# write code hereif root is None:return []queue = [root]res = []while queue:node = queue.pop(0)res.append(node.val)if node.left:queue.append(node.left)if node.right:queue.append(node.right)return res

网友值得参考的解答

Solution 1, (6 lines)

def levelOrder(self, root):ans, level = [], [root]while root and level:ans.append([node.val for node in level])LRpair = [(node.left, node.right) for node in level]level = [leaf for LR in LRpair for leaf in LR if leaf]return ans

Solution 2, (5 lines), same idea but use only one list comprehension in while loop to get the next level

def levelOrder(self, root):ans, level = [], [root]while root and level:ans.append([node.val for node in level])            level = [kid for n in level for kid in (n.left, n.right) if kid]return ans

Solution 3 (10 lines), just an expansion of solution 1&2 for better understanding.

def levelOrder(self, root):if not root:return []ans, level = [], [root]while level:ans.append([node.val for node in level])temp = []for node in level:temp.extend([node.left, node.right])level = [leaf for leaf in temp if leaf]return ans

other

def levelOrder(self, root):ret = []  level = [root]while root and level:currentNodes = []nextLevel = []for node in level:currentNodes.append(node.val)if node.left:nextLevel.append(node.left)if node.right:nextLevel.append(node.right)ret.append(currentNodes)level = nextLevelreturn ret

102. Binary Tree Level Order Traversal相关推荐

LeetCode: 102. Binary Tree Level Order Traversal
题目 Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to rig ...
Leetcode 102. Binary Tree Level Order Traversal（二叉树的层序遍历）
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, ...
Leet Code OJ 102. Binary Tree Level Order Traversal [Difficulty: Easy]
题目: Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to ri ...
LeetCode 102. Binary Tree Level Order Traversal
原题 Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to rig ...
107. Binary Tree Level Order Traversal II
题目 Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from l ...
LeetCode: 107. Binary Tree Level Order Traversal II
题目 Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from l ...
LeetCode 107. Binary Tree Level Order Traversal II
LeetCode 107. Binary Tree Level Order Traversal II Solution1:我的答案比102那道题多了一行代码... /*** Definition f ...
Binary Tree Level Order Traversal II 解题思路
思路: 与Binary Tree Level Order Traversal I 几乎一样.只是最后将结果存放在栈里,然后在栈里再传给向量即可. 再次总结思路: 两个queue,先把第一个放进q1,循 ...
[LeetCode] Binary Tree Level Order Traversal 二叉树层次遍历(DFS | BFS)
目录: 1.Binary Tree Level Order Traversal - 二叉树层次遍历 BFS 2.Binary Tree Level Order Traversal II - 二叉树层次 ...

102. Binary Tree Level Order Traversal

题目 Binary Tree Level Order Traversal

解答

my answer

python 解法2

网友值得参考的解答

102. Binary Tree Level Order Traversal相关推荐

最新文章

热门文章