026-二叉搜索树与双向链表

思路：中序遍历

双向链表连接

 

public class Solution {
    private TreeNode head=null;
    private TreeNode tail=null;
    public TreeNode Convert(TreeNode pRootOfTree) {
        visit(pRootOfTree);
        return head;
    }
    
    public void visit(TreeNode root)
    {
        if(root==null)
            return;
        visit(root.left);
        create(root);
        visit(root.right);
    }
    
    public void create(TreeNode cur)
    {
        cur.left=tail;
        if(tail!=null)
        {
            tail.right=cur;
        }
        else
        {
            head=cur;
        }
        tail=cur;
    }
}