/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
TreeNode* Convert(TreeNode* pRootOfTree)
{
if(pRootOfTree == NULL)
return NULL;
if(pRootOfTree->left == NULL && pRootOfTree->right == NULL)
return pRootOfTree;
TreeNode *p = Convert(pRootOfTree->left);
TreeNode *tmp = p;
while(tmp->right != NULL && tmp != NULL){
tmp = tmp->right;
}
if(tmp != NULL){
tmp->right = pRootOfTree;
pRootOfTree->left = tmp;
}
tmp = Convert(pRootOfTree->right);
if(tmp != NULL){
pRootOfTree->right = tmp;
tmp->left = pRootOfTree;
}
return p != NULL ? p : pRootOfTree;
}
};