二叉搜索树与双向链表

题目描述

输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点，只能调整树中结点指针的指向。

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;
    }
};