题目描述:
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 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==NULL)
return res;
stack<TreeNode*> s;
s.push(root);
while(!s.empty())
{
TreeNode* topnode=s.top();
res.push_back(topnode->val);
s.pop();
if(topnode->right!=NULL)
s.push(topnode->right);
if(topnode->left!=NULL)
s.push(topnode->left);
}
return res;
}
};