二叉搜索树与双向链表*

题目描述

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

解法1：

分析解决(复杂不推荐)

public class Solution {
    public TreeNode Convert(TreeNode pRootOfTree) {
        if(pRootOfTree == null){
            return null;
        }
        if(pRootOfTree.left == null&&pRootOfTree.right == null){
            return pRootOfTree;
        }
        TreeNode left = Convert(pRootOfTree.left);
        TreeNode temp = left;
        while(temp != null && temp.right != null){
            temp = temp.right;//找到当前最后一个左子树最右的结点
        }
        if(left != null){//互相连接
            temp.right = pRootOfTree;
            pRootOfTree.left = temp;
        }
        TreeNode right = Convert(pRootOfTree.right);
        if(right != null){//互相连接
            right.left = pRootOfTree;
            pRootOfTree.right = right;
        }        
        return left!=null?left:pRootOfTree;//s首结点位置      
    }
}

解法2：

中序遍历(推荐）
值得留意的是pre是成员变量

public class Solution {
    public TreeNode pre = null;
    public TreeNode Convert(TreeNode pRootOfTree) {
        if(pRootOfTree == null){
            return null;
        }
        fun(pRootOfTree);
        while(pRootOfTree.left != null){
            pRootOfTree = pRootOfTree.left;
        }
        return pRootOfTree;
    }
    public void fun(TreeNode cur){
        if(cur == null){
            return;
        }        
        fun(cur.left);
        cur.left = pre;
        if(pre != null){
            pre.right = cur;
        }
        pre = cur;
        fun(cur.right);
    }
}