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]
.
Note: Recursive solution is trivial, could you do it iteratively?
思路:后遍历的点先存到栈。
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
if (!root) return res;
stack<TreeNode*> stk;
TreeNode* p;
stk.push(root);
while (!stk.empty()){
p = stk.top();
stk.pop();
res.push_back(p->val);
if (p->right)
stk.push(p->right);
if (p->left)
stk.push(p->left);
}
return res;
}
};