二叉树 -- 5.1.1 Binary Tree Level Order Traversal-1 -- 图解

/**********************************************************************************************************
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from le 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],
[9,20],
[15,7]
]
**********************************************************************************************************/

Class Solution{
public:vector<vector<int> > levelOrder(TreeNode * root){vector<vector<int>> result;if(root == nullptr){return result;}queue<TreeNode*> current, next;vector<int> level;current.push(root);while(!current.empty()){while(!current.empty()){TreeNode * node = current.front();current.pop();level.push_back(node);if(node->left != nullptr) next.push(node->left);if(node->right != nullptr) next.push(node->right);}result.push_back(level->val);level.clear();swap(next,current);}return result;}
};

使用双队列完成层序遍历，取出队首.ftont() ,出队列.pop()

参考资料：

LeetCode题解

二叉树 -- 5.1.1 Binary Tree Level Order Traversal-1 -- 图解相关推荐

[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 层次遍历二叉树链接 Given a binary tree, return the level order traversa ...
LeetCode 107. Binary Tree Level Order Traversal II
LeetCode 107. Binary Tree Level Order Traversal II Solution1:我的答案比102那道题多了一行代码... /*** Definition f ...
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 ...
Binary Tree Level Order Traversal II 解题思路
思路: 与Binary Tree Level Order Traversal I 几乎一样.只是最后将结果存放在栈里,然后在栈里再传给向量即可. 再次总结思路: 两个queue,先把第一个放进q1,循 ...
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, ...
LeetCode之Binary Tree Level Order Traversal 层序遍历二叉树
题目描述: Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to ...
【Binary Tree Level Order Traversal】cpp
题目: Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to ri ...
【LeetCode从零单排】No102 Binary Tree Level Order Traversal
题目 Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to rig ...

二叉树 -- 5.1.1 Binary Tree Level Order Traversal-1 -- 图解

二叉树 -- 5.1.1 Binary Tree Level Order Traversal-1 -- 图解相关推荐

最新文章

热门文章