题目:给定一个二叉树,返回它的 前序 遍历。
示例:
输入: [1,null,2,3]
输出: [1,2,3]
方法一:递归
这是最容易想到且最容易实现的算法。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int>res;
vector<int> preorderTraversal(TreeNode* root) {
if(root==nullptr) return res;
res.emplace_back(root->val);
preorderTraversal(root->left);
preorderTraversal(root->right);
return res;
}
};
方法二:迭代法
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int>res;
if(root==nullptr) return res;
stack<TreeNode*> stk;
TreeNode* temp=root;
while(!stk.empty() || temp!=nullptr){
while(temp!=nullptr){
res.emplace_back(temp->val);
stk.push(temp);
temp=temp->left;
}
temp=stk.top();
stk.pop();
temp=temp->right;
}
return res;
}
};