102 给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[9,20],
[15,7]
]
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
1.创建一个队列,把起始 节点放到里面去(第一层节点),
2.while队列不空,处理队列这种的节点,,并拓展新的节点
3 level x->x+1
*/
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> results;
if(root==NULL){
return results;
}
//1 put start node into queue
queue<TreeNode *> Q;
Q.push(root);
//while queue is not empty
while(!Q.empty()){
vector<int> currentlevel;
int size=Q.size();
for(int i=0 ; i<size ; i++ ) {//level x
TreeNode* head=Q.front();
Q.pop();
currentlevel.push_back(head->val);
if( head->left!=NULL ) {
Q.push(head->left);
}
if( head->right!=NULL ) {
Q.push(head->right);
}
}
results.push_back(currentlevel);
}
return results;
}
};
103给定一个二叉树,返回其节点值的锯齿形层次遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
例如:
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回锯齿形层次遍历如下:
[
[3],
[20,9],
[15,7]
]
这个题与上个题思路差不多,引入一个count计数记录奇数层,偶数层即可
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> results;
if(root==NULL){
return results;
}
int count = 0;
//1 put start node into queue
queue<TreeNode *> Q;
Q.push(root);
//while queue is not empty
while(!Q.empty()){
vector<int> currentlevel;
int size=Q.size();
for(int i=0 ; i<size ; i++ ) {//level x
TreeNode* head=Q.front();
Q.pop();
currentlevel.push_back(head->val);
if( head->left!=NULL ) {
Q.push(head->left);
}
if( head->right!=NULL ) {
Q.push(head->right);
}
}
if(count%2 == 0){
results.push_back(currentlevel);
}else{
reverse(currentlevel.begin(),currentlevel.end());
results.push_back(currentlevel);
}
count++;
}
return results;
}
};