二叉搜索树转换为链表

package com.algorithm;

public class BstALL {
//输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。
//要求不能创建任何新的结点，只能调整树中结点指针的指向
     public TreeNode Convert(TreeNode pRootOfTree) {
            if(pRootOfTree == null)
                return null;
            if(pRootOfTree.left == null && pRootOfTree.right == null)
                return pRootOfTree;
            //1、将左子树 构造成双链表，并返回链表头结点
            TreeNode left = Convert(pRootOfTree.left);
            TreeNode p = left;
            //2、定位至左子树双链表最后一个节点
            while(p!=null && p.right != null){
                p = p.right;
            }
            //3、如果左子树链表不为空，将当前root追加到左子树链表
            if(left != null){
                p.right = pRootOfTree;
                pRootOfTree.left = p;
            }
            //4、将右子树构成双链表，并返回链表头结点
            TreeNode right = Convert(pRootOfTree.right);
            //如果右子树链表不为空的话，将该链表追加到root节点之后
            if(right != null){
                right.left = pRootOfTree;
                pRootOfTree.right = right;
            }
            return left!=null?left:pRootOfTree;
      }
     public static void main(String[] args) {
         TreeNode root = new TreeNode(10);
         TreeNode rootleft = new TreeNode(6);
         TreeNode rootright = new TreeNode(14);
         root.left = rootleft;
         root.right = rootright;
         
         TreeNode root2 = new TreeNode(4);
         TreeNode root3 = new TreeNode(8);
         
         rootleft.left = root2;
         rootleft.right = root3;
         
         TreeNode root4 = new TreeNode(12);
         TreeNode root5 = new TreeNode(16);
         
         rootright.left = root4;
         rootright.right = root5;
         
         new BstALL().Convert(root);
         
    }
}