【LeetCode】Binary Tree Inorder Traversal

/**
 * 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*> node;
	vector<int> result;
	TreeNode *tmp;
	tmp = root;
	while (tmp || node.size())
	{
		while (tmp)
		{
			node.push(tmp);
			tmp = tmp->left;
		}
		if (node.size())
		{
			tmp = node.top();
	//		cout << tmp->val << " ";
			result.push_back(tmp->val);
			node.pop();
			tmp = tmp->right;
		}
	}
	return result;
    }
};