剑指offer-二叉搜索树与双向链表

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

public class Solution {
        public TreeNode Convert(TreeNode pRootOfTree) {
            if (pRootOfTree == null) {
                return null;
            }
            if (pRootOfTree.right == null && pRootOfTree.left == null) {
                return pRootOfTree;
            }
            TreeNode left = Convert(pRootOfTree.left);
            TreeNode p = left;
            while (p != null && p.right != null) {
                p = p.right;
            }
            if (left != null) {
                p.right = pRootOfTree;
                pRootOfTree.left = p;
            }
            TreeNode right = Convert(pRootOfTree.right);
            if (right != null) {
                pRootOfTree.right = right;
                right.left = pRootOfTree;
            }
            return left == null ? pRootOfTree : left;
        }
    }

非递归：

public TreeNode Convert(TreeNode pRootOfTree) {
            if (pRootOfTree == null) {
                return null;
            }
            Stack<TreeNode> stack = new Stack<>();
            TreeNode p = pRootOfTree;
            TreeNode pre = null;
            boolean isFirst = true;
            while (p != null || !stack.isEmpty()) {
                while (p != null) {
                    stack.push(p);
                    p = p.left;
                }
                p = stack.pop();
                if (isFirst) {
                    pRootOfTree = p;
                    pre = pRootOfTree;
                    isFirst = false;
                } else {
                    pre.right = p;
                    p.left = pre;
                    pre = p;
                }
                p = p.right;
            }
            return pRootOfTree;
        }