【树】leetcode_114_二叉树的前序遍历
c++递归,回顾一下,
/**
* 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> re;
get_re(root, re);
return re;
}
void get_re(TreeNode *root, vector<int> &re){
if (root == nullptr){
return;
}
re.push_back(root->val);
get_re(root->left,re);
get_re(root->right,re);
}
};
迭代
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> result;
stack<TreeNode*> re;
while(root != nullptr || !re.empty()){
while(root != nullptr){
result.push_back(root->val);
re.push(root);
root = root->left;
}
if(!re.empty()){
root = re.top();
re.pop();
root = root->right;
}
}
return result;
}
};