94. 二叉树的中序遍历（C++题解版含VS可运行源码）

1.力扣C++源码

/**
 * 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> inorderTraversal(TreeNode* root) {
   
        Recursion(root);
        return res;
	}
    vector<int> res;
    void Recursion(TreeNode* root) {
   
        if (!root)return;
        Recursion(root->left);
        res.push_back(root->val);
        Recursion(root->right);
    }


};

2.题解

• 解法一：递归法中序遍历二叉树
• 解法二：迭代法基于栈中序遍历二叉树
• 思想都很简单

3.VS可运行源码

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<vector>
#