将二叉查找树转换成双链表

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 * Definition for Doubly-ListNode.
 * public class DoublyListNode {
 *     int val;
 *     DoublyListNode next, prev;
 *     DoublyListNode(int val) {
 *         this.val = val;
 *         this.next = this.prev = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of tree
     * @return: the head of doubly list node
     */
    private DoublyListNode nodeList;
    private DoublyListNode totle;
    public DoublyListNode bstToDoublyList(TreeNode node) {
        // Write your code here
        if (node == null){
            return null;
        }
        //中序遍历
        bstToDoublyList(node.left);
        if (nodeList == null){
            nodeList =  totle = new DoublyListNode(node.val);
        }else{
            DoublyListNode list = new DoublyListNode(node.val);
            list.prev = nodeList;
            nodeList.next = list;
            nodeList = nodeList.next;
        }
        bstToDoublyList(node.right);
        return this.totle;
    }
}