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,#,#,15,7}
,
3 / \ 9 20 / \ 15 7
return its level order traversal as:
[ [3], [9,20], [15,7] ]
1、简单的层次遍历,用队列实现
队列常用操作:
push(x) 将x压入队列的末端
pop() 弹出队列的第一个元素(队顶元素),注意此函数并不返回任何值
front() 返回第一个元素(队顶元素)
back() 返回最后被压入的元素(队尾元素)
empty() 当队列为空时,返回true
size() 返回队列的长度
使用方法:
头文件:
#include
<
queue
>
2、vector释放内存swap
vector< T >().swap(X) //T是类型,X是要操作的vector
3、.empty()函数当对象为空时返回true,所以想判断非空要!。(这种地方也出错,我也是对我自己醉了)
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int> > levelOrder(TreeNode *root) {
vector<vector<int> > v;
if(root==NULL)
return v;
vector<int> temp;
queue<TreeNode *> q;
q.push(root);
int j=0,len=q.size();
while(!q.empty())
{
temp.push_back(q.front()->val);
if(q.front()->left!=NULL)
q.push(q.front()->left);
if(q.front()->right!=NULL)
q.push(q.front()->right);
q.pop();
j++;
if(j==len)
{
v.push_back(temp);
vector<int>().swap(temp);
len=q.size();
j=0;
}
}
return v;
}
};