【LeetCode】94. Binary Tree Inorder Traversal

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]

.

/**
* 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> result;
stack<TreeNode*> stk;
TreeNode* tmp = root;
while(!stk.empty()||tmp!=NULL)
{
while(tmp!=NULL)
{
stk.push(tmp);
tmp = tmp->left;
}
tmp =stk.top();
result.push_back(tmp->val);
stk.pop();
tmp = tmp->right;
}
return result;
}
};