目录
144 二叉树的前序遍历
class Solution {
public:
void rpreprint(TreeNode* root, vector<int> &v){
if(root == nullptr) {
return;
}
v.push_back(root->val);
rpreprint(root->left, v);
rpreprint(root->right, v);
}
vector<int> preorderTraversal(TreeNode* root) {
//前序遍历->中左右
vector<int> v;
rpreprint(root, v);
return v;
}
};
145 二叉树的后序遍历
class Solution {
public:
void inorder(TreeNode *root, vector<int> &v){
if(root == nullptr){
return;
}
inorder(root->left, v);
v.push_back(root->val);
inorder(root->right, v);
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> result;
inorder(root, result);
return result;
}
};
94 二叉树的中序遍历
class Solution {
public:
void ostorder(TreeNode *root, vector<int> &v){
if(root == nullptr){
return;
}
//后序->左右中
ostorder(root->left, v);
ostorder(root->right, v);
v.push_back(root->val);
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int> result;
ostorder(root, result);
return result;
}
};