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

将一个二叉查找树按照中序遍历转换成双向链表。
样例
给定一个二叉查找树：
4
/ \
2 5
/ \
1 3
返回 1<->2<->3<->4<->5。

解题思路：类似中序遍历的过程，递归或者基于栈的非递归来实现。

/**
 * 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
     */
    public DoublyListNode bstToDoublyList(TreeNode root) {
        if(root == null) return null;
        if(root.left == null && root.right == null){
            DoublyListNode res = new DoublyListNode(root.val);
            return res;
        }
        DoublyListNode curr = new DoublyListNode(root.val);
        DoublyListNode left = bstToDoublyList(root.left);
        DoublyListNode node = left;
        while(node != null && node.next != null){
            node = node.next;
        }
        if(left != null){
            node.next = curr;
            curr.prev = node;
        }
        DoublyListNode right = bstToDoublyList(root.right);
        if(right != null){
            curr.next = right;
            right.prev = curr;
        }
        if(left == null) return curr;
        return left;

    }
}

/**
 * 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
     */
    public DoublyListNode bstToDoublyList(TreeNode root) {
        if(root == null) return null;
        DoublyListNode res = new DoublyListNode(0);
        DoublyListNode node = res;
        Stack<TreeNode> stack = new Stack<TreeNode>();
        TreeNode cursor = root;
        while(cursor != null || !stack.empty()){
            while(cursor != null){
                stack.push(cursor);
                cursor = cursor.left;
            }
            cursor = stack.pop();
            DoublyListNode tmp = new DoublyListNode(cursor.val);
            node.next = tmp;
            tmp.prev = node;
            node = node.next;

            cursor = cursor.right;

        }
        return res.next;
    }
}