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?
二叉树的前序遍历,非递归的话,利用一个来记录遍历的路径。
/**
* 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) {
stack<TreeNode*>s;
vector<int>vec;
TreeNode *temp = root;
s.push(NULL);
while (temp)
{
vec.push_back(temp->val);
if (temp->right)
s.push(temp->right);
if (temp->left)
temp = temp->left;
else if (!s.empty())
{
temp = s.top();
s.pop();
}
}
return vec;
}
};