Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [1,3,2]
.
Note: Recursive solution is trivial, could you do it iteratively?
Difficulty:Medium
vector<int> gen(vector<int>& nums,TreeNode* root){
if(root==NULL)
return nums;
vector<int> ans;
ans = gen(nums,root->left);
ans.push_back(root->val);
ans = gen(ans,root->right);
return ans;
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> ans;
ans = gen(ans,root);
return ans;
}