class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> v;
traversal(root,v);
return v;
}
void traversal(TreeNode* root,vector<int>& v){
if(root == NULL)
return;
traversal(root->left,v);
v.push_back(root->val);
traversal(root->right,v);
}
};
03-11