题解 | #二叉树的中序遍历#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
public:
    void inorder(vector<int> &res,TreeNode* root)
    {
        if(root == NULL)
        return;
        inorder(res,root->left);
        res.push_back(root->val);
        inorder(res,root->right); 
    }
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        inorder(res,root);
        return res;
    }
};