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].

Note: Recursive solution is trivial, could you do it iteratively?

/**
 * Definition for binary tree
 * 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) {
		stack<TreeNode*>s;
		vector<int>vec;
		TreeNode *temp = root;
		do
		{
			while (temp)
			{
				s.push(temp);
				temp = temp->left;
			}
			if (!s.empty())
			{
				temp = s.top();
				s.pop();
				vec.push_back(temp->val);
				temp = temp->right;
			}
		} while (!s.empty() || temp != NULL);
		return vec;

	}
};

这边循环有两个判断条件，栈空并且遍历指针为空才表明遍历完全。