JZ26 二叉搜索树与双向链表

排序二叉树用中序遍历，先来个中序遍历的模板

public class Solution {
    public TreeNode Convert(TreeNode pRootOfTree) {
        if(pRootOfTree == null) {
            return null;
        }
        
        Convert(pRootOfTree.left);
        (这里写对应的操作)
        Convert(pRootOfTree.right);
       
    }
}

我们需要拿到当前节点的前一个节点，所以再递归的时候用一个变量pre保存前一个节点

public class Solution {
    TreeNode pre = null;
    public TreeNode Convert(TreeNode pRootOfTree) {
        if(pRootOfTree == null) {
            return null;
        }
        
        Convert(pRootOfTree.left);

        //当前节点的前驱存在的时候
        if(pre != null) {
            pre.right = pRootOfTree;
            pRootOfTree.left = pre;
        }
        //前驱节点指向当前节点，变为下一个节点的前驱
        pre = pRootOfTree;
        Convert(pRootOfTree.right);
        
        return pre ;
    }
}

但是返回的pre是链表的尾节点，再创建一个临时节点保存头节点

public class Solution {
    TreeNode root = null;
    TreeNode pre = null;
    public TreeNode Convert(TreeNode pRootOfTree) {
        if(pRootOfTree == null) {
            return null;
        }
        
        Convert(pRootOfTree.left);
        //刚递归到此处的时候是链表的头节点
        if(root == null) {
            root = pRootOfTree;
        }
        
        if(pre != null) {
            pre.right = pRootOfTree;
            pRootOfTree.left = pre;
        }
        
        pre = pRootOfTree;
        Convert(pRootOfTree.right);
        
        return root;
    }
}