中序遍历

虽然很简单，还是记录一下啊！

/**
 * 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> ret;

    void inorder(TreeNode* root) {
        if (root == nullptr) {
            return;
        }

        inorder(root -> left);
        ret.push_back(root -> val);
        inorder(root -> right);
    }

    vector<int> inorderTraversal(TreeNode* root) {
        inorder(root);
        return ret;
    }
};