这就是个倒序输出嘛,用stack把扩展一下栈内的结点,输出目前刚刚进去的孩子,就行
/**
* 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<int> preorderTraversal(TreeNode* root) {
vector<int>ans;
if(!root) return ans;
stack<TreeNode* >q;
q.push(root);
while(!q.empty())
{
TreeNode* t = q.top();
ans.push_back(t->val);
q.pop();
if(t->right) q.push(t->right);
if(t->left) q.push(t->left);
}
return ans;
}
};