题目描述
思路分析
双栈迭代
代码展示
/**
* 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:
void _help(vector<int>& ret, TreeNode* root) {
stack<TreeNode*> s1;
stack<TreeNode*> s2;
s1.push(root);
while (!s1.empty() || !s2.empty()) {
while (!s1.empty()) {
TreeNode* tmp = s1.top();
ret.push_back(tmp->val);
if (tmp->left) {
s2.push(tmp->left);
}
if (tmp->right) {
s2.push(tmp->right);
}
s1.pop();
}
while (!s2.empty()) {
s1.push(s2.top());
s2.pop();
}
}
}
vector<int> levelOrder(TreeNode* root) {
vector<int> ret;
if (root == NULL) {
return ret;
}
_help(ret, root);
return ret;
}
};
结果分析
时间复杂度O(N)
空间复杂度O(N)