牛客网剑指offer-二叉搜索树与双向链表

题目描述

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

/*
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 == nullptr)
            return nullptr;
        TreeNode *pHead = nullptr, *pTail = nullptr;
        dfs(pRootOfTree, pHead, pTail);
        return pHead;
    }
private:
    //DFS，用两个指针的引用来返回子树连接后的头和尾，然后左子树的尾和右子树的头与根节点连接，
    //再将左子树的头和右子树的尾作为新的头尾返回给上层
    void dfs(TreeNode* p, TreeNode* &pHead, TreeNode* &pTail)
    {
        TreeNode *p1, *p2;
        if (p->left != nullptr)
        {
            dfs(p->left, pHead, pTail);
            p1 = pHead;
            pTail->right = p;
            p->left = pTail;
        }
        else
        {
            p1 = pHead = p;
        }
        if (p->right != nullptr)
        {
            dfs(p->right, pHead, pTail);
            p2 = pTail;
            pHead->left = p;
            p->right = pHead;
        }
        else
        {
            p2 = pTail = p;
        }
        pHead = p1;
        pTail = p2;
    }
};