Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [1,2,3]
.
/**
* 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> a;
stack<TreeNode*> s;
int i = 0;
TreeNode* p = root;
while(true)
{
while(p)
{
a.insert(a.begin()+i,p->val);
i++;
s.push(p->right);
p = p->left;
}
if(s.empty()) break;
p = s.top();
s.pop();
}
return a;
}
};