题目链接:94. 二叉树的中序遍历 - 力扣(LeetCode)
中序遍历就是先遍历左子树再遍历根最后遍历右子树
class Solution {
public:void traverse(TreeNode *root) {if (!root)return;traverse(root->left);ans.push_back(root->val);traverse(root->right);}vector<int> ans;vector<int> inorderTraversal(TreeNode *root) {traverse(root);return ans;}
};