/**
* 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:
void preo(TreeNode* root,vector<int> &an)
{
if(root==NULL)
return ;
an.push_back(root->val);
preo(root->left,an);
preo(root->right,an);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int>an;
preo(root,an);
return an;
}
};
先序遍历顺序和深度优先搜索相同,递归处理
/**
* 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>an;
if(root==NULL)
return an;
stack<TreeNode*>stk;
TreeNode* node=root;
while(!stk.empty()||node!=NULL)
{
while(node!=NULL)
{
an.push_back(node->val);
stk.emplace(node);
node=node->left;
}
node=stk.top();
stk.pop();
node=node->right;
}
return an;
}
};
维护一个栈,栈后进先出的特点符合遍历的特点,理解还好,自己写可能难度比较大