1.前序遍历
/**
* 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 get_result(TreeNode *cur,vector<int> &result){
if(cur==NULL){
return;
}
result.push_back(cur->val);
get_result(cur->left,result);
get_result(cur->right,result);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> result;
get_result(root,result);
return result;
}
};
2.中序遍历
/**
* 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 get_value(TreeNode *cur,vector<int> &result){
if(cur==NULL) return;
get_value(cur->left,result);
result.push_back(cur->val);
get_value(cur->right,result);
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> result;
get_value(root,result);
return result;
}
};
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:
void get_value(TreeNode *cur,vector<int> &result){
if(cur==NULL) return;
get_value(cur->left,result);
get_value(cur->right,result);
result.push_back(cur->val);
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int> result;
get_value(root,result);
return result;
}
};