[LeetCode] Level Order Traversal 题目说明 Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7 return its level order traversal as: [ [3]...
}private:voidlevelOrder(TreeNode* root,intcurrLevel) {if(root == NULL)return;if(res.empty() || currLevel > (res.size() -1)) res.push_back(vector<int>()); res[currLevel].push_back(root->val); levelOrder(root->left, currLevel +1); levelOrder(root->right, currLevel +1); } ...
JavaScript实现 1/**2* @param {TreeNode} root3* @return {number[][]}4*/5varzigzagLevelOrder =function(root) {6varres =[];7//corner case8if(root ===null) {9returnres;10}1112//normal case13varqueue =[];14queue.push(root);15varx =true;16while(queue.length > 0) {17varsize =q...
5. return its bottom-up level order traversal as: [ [15,7], [9,20], [3] ] 1. 2. 3. 4. 5. 分析: 这道题目跟上道题目很相似 Leetcode: Binary Tree Level Order Traversal ,唯一不同的就是返回结果是从子叶节点到根节点,所以我们只需要将结果翻转下就好了! 参考代码: /** * Definition f...
这道题和LeetCode笔记:107. Binary Tree Level Order Traversal II是姊妹题,解题思路都是一样的,只是结果要求的顺序是反的,同样有两种方法,也就是经常说到的DFS深度优先遍历和BFS广度优先遍历。 BFS: 广度优先遍历就是一层层地攻略过去,把每一层的所有节点都记录下来再走向下一层。因为每层会有多个节点,不是简...
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] ] 【Idea】 这个题也不难, 因为O(n)还蛮能打的, 所以po一下 BFS要更好写一些。 这里每层遍历node时直接用了for,没有用queue,不然还要另起个变量标记 ...
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, level by level). For example: Given binary tree [3,9,20,null,null,15,7], retu......
fromcollectionsimportdeque# 定义二叉树节点classTreeNode:def__init__(self,val=0,left=None,right=None):self.val=valself.left=leftself.right=rightdeflevelOrder(root):# 如果根节点为空,返回空列表ifnotroot:return[]# 初始化队列和结果列表queue=deque([root])result=[]whilequeue:level_size=len(queue...
Can you solve this real interview question? Binary Tree Level Order Traversal - Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). Example 1: [https://assets.leetcode.c
简介:题目:Binay Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes' values. 题目:Binay Tree Level Order Traversal Given a binary tree,returnthe level order traversal of its nodes'values. (ie, from left to right, level by level).For example: ...