中序遍历:左-中-右
class Solution {
public:
void midorder(TreeNode* root,vector<int> &res){
if(root!=nullptr){
midorder(root->left, res);
res.push_back(root->val);
midorder(root->right,res);
}
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
midorder(root,res);
return res;
}
};