Given a binary tree, return the preorder traversal of its nodes' values.
Example:
Input:[1,null,2,3]
1 \ 2 / 3 Output:[1,2,3]
Follow up: Recursive solution is trivial, could you do it iteratively?
/**
* 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> result;
if(root==NULL){
return vector<int> ();
}
stack<TreeNode*>treestack;
treestack.push(root);
while(!treestack.empty()){
TreeNode* cur = treestack.top();
result.push_back(cur->val);
treestack.pop();
if(cur->right!=NULL){
treestack.push(cur->right);
}
if(cur->left!=NULL)
treestack.push(cur->left);
}
return result;
}
};
就是先序遍历二叉树的非递归算法,就是让右子树先进栈。