Given a binary tree, return the inorder traversal of its nodes' values.
Example:
Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,3,2]
Follow up: Recursive solution is trivial, could you do it iteratively?
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
if(root==NULL)
return vector<int>();
vector<int> result;
vector<TreeNode *> stack;
stack.push_back(root);
while(!stack.empty())
{
TreeNode *top = stack.back();
if(top->left!=NULL)
{
stack.push_back(top->left);
top->left = NULL;
}
else
{
result.push_back(top->val);
cout<<top->val<<endl;
stack.pop_back();
if(top->right!=NULL)
{
stack.push_back(top->right);
}
}
}
return result;
}
};