题目描述:请实现一个函数按照之字形顺序打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右到左的顺序打印,第三行再按照从左到右的顺序打印,其他行以此类推。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[20,9],
[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) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int> > result;
if(! root)
return result;
queue<TreeNode*> q;
q.push(root);
result.push_back(vector<int>());
int level = 0;
TreeNode* last = root, * rear = root;
while (!q.empty())
{
TreeNode* node = q.front();
q.pop();
result[level].push_back(node->val);
if(node->left){
q.push(node->left);
rear = node->left;
}
if(node->right){
q.push(node->right);
rear = node->right;
}
if(node == last){
//翻转元素
if(level % 2 == 1)
reverse(result[level].begin(), result[level].end());
if(rear != last){
++level;
result.push_back(vector<int>());
last = rear;
}
}
}
return result;
}
};