【剑指offer】搜索二叉树与双向链表

题目描述

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

class Solution {
public:
    
    TreeNode* Convert(TreeNode* pRootOfTree)
    {
        if(pRootOfTree == NULL)
            return NULL;
        TreeNode* pre = NULL;
        _Convert(pRootOfTree, pre);
        TreeNode* ret = pRootOfTree;
        while(ret->left)
            ret = ret->left;
        return ret;
    }
    void _Convert(TreeNode* pRootOfTree, TreeNode*& pre)
    {
        if(pRootOfTree == NULL)
            return;
        _Convert(pRootOfTree->left, pre); 
        if(pre != NULL)
            pre->right = pRootOfTree;
        pRootOfTree->left = pre;
        pre = pRootOfTree;
        _Convert(pRootOfTree->right, pre);
    }
};