剑指offer之二叉搜索树与双向链表-优快云博客

本文链接：https://blog.youkuaiyun.com/art_code/article/details/90499708

本文介绍了一种将二叉搜索树转换为双向链表的方法。通过递归地调整树节点的左右指针，使得每个节点的左指针指向其前驱节点，右指针指向其后继节点，最终形成一个有序的双向链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}

public class Solution {
    public TreeNode Convert(TreeNode pRootOfTree) {
        if (pRootOfTree == null)
            return pRootOfTree;
        //TreeNode pLastOfList = null;
        TreeNode pLastOfList = new TreeNode(0);
        pLastOfList = ConvertNode(pRootOfTree, pLastOfList);
        TreeNode pHeadOfList = pLastOfList;
        while (pLastOfList!=null  && pHeadOfList.left!=null) {
            pHeadOfList = pHeadOfList.left;
        }
        pHeadOfList = pHeadOfList.right;
        pHeadOfList.left = null;
        return pHeadOfList;
    }

    public TreeNode ConvertNode (TreeNode pNode, TreeNode pLastOfList) {
        if (pNode == null) 
            return pNode;
        TreeNode pCurrent = pNode;
        if (pCurrent.left != null) 
            pLastOfList = ConvertNode(pCurrent.left, pLastOfList);
        pCurrent.left = pLastOfList;
        if (pLastOfList != null)
            pLastOfList.right = pCurrent;
        pLastOfList = pCurrent;
        if (pCurrent.right != null) {
            pLastOfList = ConvertNode(pCurrent.right, pLastOfList);
        }
        return pLastOfList;
    }