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) {
        vector<int> inorder;
        stack<TreeNode *> tree;
        TreeNode *p=root;

        if(p==NULL)  return inorder;
        while(p||!tree.empty())
        {
            if(p)
            {
               tree.push(p);
               p=p->left;
            }
            
            else
            {
                p=tree.top();
                inorder.push_back(p->val);
                tree.pop();
                p=p->right;          
            }
        }
        return inorder;
}
};