/*
struct TreeLinkNode {
int val;
struct TreeLinkNode *left;
struct TreeLinkNode *right;
struct TreeLinkNode *next;
TreeLinkNode(int x) :val(x), left(NULL), right(NULL), next(NULL) {
}
};
*/
class Solution {
public:
TreeLinkNode* GetNext(TreeLinkNode* pNode)
{
TreeLinkNode *pcur=NULL;
if(pNode->right!=NULL)
{
pcur=pNode->right;
while(pcur->left!=NULL)
{
pcur=pcur->left;
}
return pcur;
}
if(pNode->next==NULL)
{
return NULL;
}
if(pNode==pNode->next->left)
{
return pNode->next;
}
pcur=pNode->next;
while(pcur->next)
{
if(pcur==pcur->next->left)
{
return pcur->next;
}
pcur=pcur->next;
}
return NULL;
}
};