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]
.
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> a;
stack<TreeNode*> s;
TreeNode* p = root;
int i = 0;
while(true)
{
while(p)
{
s.push(p);
p=p->left;
}
if(s.empty()) break;
p = s.top();
s.pop();
a.insert(a.begin()+i, p->val);
i++;
p = p->right;
}
return a;
}
};