力扣 94. 二叉树的中序遍历🔗 https://leetcode.cn/problems/binary-tree-i

题目

中序遍历是，先访问节点的 left，再是本身，再是 right

思路

递归

代码

/**
 * 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> vec;
    void mid(TreeNode* node) {
        if (node == nullptr) return;
        mid(node->left);
        vec.push_back(node->val);
        mid(node->right);
    }
    vector<int> inorderTraversal(TreeNode* root) {
        mid(root);
        return vec;
    }
};