非递归版:
/**
* Definition for binary tree
* 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> res;
if( !root)
return res;
stack< TreeNode *> stk;
TreeNode *p = root;
while(true){
while(p){
res.push_back(p->val);
stk.push(p);
p = p->left;
}
if( !stk.empty()){
p = stk.top();
stk.pop();
p = p->right;
}
else
break;
}
return res;
}
};