question:
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree [1,null,2,3]
,
vector<int> res;
void inorder(TreeNode *root)
{
if(root == NULL)
return;
inorder(root -> left);
res.push_back(root -> val);
inorder(root -> right);
}
vector<int> inorderTraversal(TreeNode* root) {
inorder(root);
return res;
}