方法一:思路:递归。(本题中不允许使用)。
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> ans;
helper(root,ans);
return ans;
}
void helper(TreeNode* root,vector<int>&ans)
{
if(!root) return ;
ans.push_back(root->val);
helper(root->left,ans);
helper(root->right,ans);
}
};
方法二:
思路:利用栈后进先出的特点,将某一节点的右子树-左子树推入栈中,然后不断取出栈顶的值,这样即可达到前序遍历的目的。
/**
* 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) {
if(!root) return {};
vector<int>ans;
stack<TreeNode*> s;
s.push(root);
while(!s.empty())
{
TreeNode* t=s.top();s.pop();
ans.push_back(t->val);
if(t->right) s.push(t->right);
if(t->left) s.push(t->left);
}
return ans;
}
};