Given a binary tree, return the inorder traversal of its nodes’ values.
For example:
Given binary tree [1,null,2,3],
1
\
2
/
3
return [1,3,2].
Note: Recursive solution is trivial, could you do it iteratively?
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
if(!root) return {};
vector<int> v=inorderTraversal(root->left);
v.push_back(root->val);
vector<int> v1=inorderTraversal(root->right);
for(auto c:v1)
v.push_back(c);
return v;
}
};