二叉搜索树与双向链表

 public Node Convert(Node node){
        Stack<Node> stack = new Stack<Node>();
        if(node == null) return null;
        Node old = null;
        Node head = null;
        while(true){
            while(node!=null){
                stack.push(node);
                node = node.left;
            }
            if(stack.isEmpty()) break;
            node = stack.pop();
            if(head == null){
                head = node;
            }
            if(old!=null){
                old.right = node;
                node.left = old;
            }
            old = node;
            node = node.right;
        }
        return head;
    }