class Solution {

public:

vector<int> temp;

void middle_order(TreeNode* root_t){

if(root_t){

if(root_t->left)middle_order(root_t->left);

temp.push_back(root_t->val);

if(root_t->right)middle_order(root_t->right);

};

};

vector<int> inorderTraversal(TreeNode* root) {

middle_order(root);

return temp;

}

};