二叉搜索树与双向链表

题目描述

class Solution {
public:
TreeNode *convert(TreeNode *p){
if(p == NULL){
return p;
}
TreeNode*q;
if(p->left)
{
q = convert(p->left);
while(q->right)
q = q->right;
q->right = p;
p->left = q;
}
if(p->right){
q = convert(p->right);
while(q->left)
q = q->left;
q->left = p;
p->right = q;
}
return p;
}
TreeNode* Convert(TreeNode* pRootOfTree)
{
if(!pRootOfTree)
return pRootOfTree;
pRootOfTree = convert(pRootOfTree);
while(pRootOfTree->left)
pRootOfTree = pRootOfTree->left;
return pRootOfTree;
}
};