二叉搜索树与双向链表

输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点，只能调整树中结点指针的指向。

//递归

TreeNode head = null;
TreeNode prev = null;

public TreeNode Convert(TreeNode root) {
	if (root == null) return null;
	
	Convert(root.left);
	
	if (head == null) head = root;
	
	if (prev != null) prev.right = root;
	root.left = prev;
	
	prev = root;
	
	Convert(root.right);
	
	return head;
	
}

//非递归

public TreeNode Convert(TreeNode root) {

        if (root == null) return null;

        TreeNode head = null;
        TreeNode curr = root;
        TreeNode prev = null;

        Deque<TreeNode> stack = new LinkedList<>();


        while (curr != null || !stack.isEmpty()) {
            while (curr != null) {
                stack.push(curr);
                curr = curr.left;
            }

            curr = stack.pop();
            if (head == null) head = curr;

            if (prev != null) prev.right = curr;
            curr.left  = prev;

            prev = curr;
            curr = curr.right;
        }

        return head;
    }