LeetCode:36.二叉树的中序遍历

目录

1.二叉树的中序遍历

---

1.二叉树的中序遍历

二叉树中序遍历顺序，左子树-根-右子树，所以我们的顺序也应当是这样

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