剑指 Offer 36. 二叉搜索树与双向链表

用中序遍历的方式，排序；然后用pre记录前一个root节点，pre.right=root;
root.left=pre;
pre=root;

/*
// Definition for a Node.
class Node {
    public int val;
    public Node left;
    public Node right;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val,Node _left,Node _right) {
        val = _val;
        left = _left;
        right = _right;
    }
};
*/
class Solution {
    Node head;
    Node pre;
    public Node treeToDoublyList(Node root) {
        if(root==null) return null;
        dp(root);
        head.left=pre;
        pre.right=head;
        return head;
    }
    public void dp(Node root){
        if(root==null) return;
        dp(root.left);
        if(pre!=null) pre.right=root;
        else head=root;
        root.left=pre;
        pre=root;
        dp(root.right);
    }
}