按之字形顺序打印二叉树_牛客题霸_牛客网 (nowcoder.com)
与按层打印二叉树不同的是,打印的方向有要求,定义一个tag,改变输入结果的方式;
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
vector<vector<int> > Print(TreeNode* pRoot) {
vector<vector<int> > res;
if(pRoot == nullptr) return res;
queue<TreeNode*> q;
q.push(pRoot);
//定义一个判断数
int level = 0;
while(!q.empty()){
vector<int> arry;
int n = q.size();
for(int i = 0; i<n; ++i){
TreeNode* temp = q.front();
q.pop();
if(temp->left) q.push(temp->left);
if(temp->right) q.push(temp->right);
//根据level数判断 输出方式
if (level % 2 == 0) arry.push_back(temp->val);
else arry.insert(arry.begin(),temp->val);
}
level++;
if(!arry.empty()) res.push_back(arry);
arry.clear();
}
return res;
}
};
事件复杂度On 空间复杂度On