题目:输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
思路:二叉搜索树的中序遍历就是从小到大,if括号中的作用就是找到二叉树的最小值,即排序链表的第一个节点。
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
TreeNode head =null;
TreeNode realHead =null;
public TreeNode Convert(TreeNode pRootOfTree) {
convertSub(pRootOfTree);
return realHead;
}
public void convertSub(TreeNode pRootOfTree){
if(pRootOfTree==null){
return;
}
convertSub(pRootOfTree.left);
if(head==null){
head = pRootOfTree;
realHead = pRootOfTree;
}else{
head.right = pRootOfTree;
pRootOfTree.left = head;
head = pRootOfTree;
}
convertSub(pRootOfTree.right);
}
}