输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
这道题明显需要中序遍历,但是对于循环return的量想了很久,后来另用了一个void返回的函数,和公共变量来完成,看答案其实也可以不另起函数。注意非常容易出现空指针的情况,注意判断。也有用ArrayList保存遍历结果的。
用ArrayList:
public TreeNode Convert(TreeNode pRootOfTree) {
if(pRootOfTree == null){
return null;
}
ArrayList<TreeNode> list = new ArrayList<>();
Convert(pRootOfTree, list);
return Convert(list);
}
//中序遍历,在list中按遍历顺序保存
public void Convert(TreeNode pRootOfTree, ArrayList<TreeNode> list){
if(pRootOfTree.left != null){
Convert(pRootOfTree.left, list);
}
list.add(pRootOfTree);
if(pRootOfTree.right != null){
Convert(pRootOfTree.right, list);
}
}
//遍历list,修改指针
public TreeNode Convert(ArrayList<TreeNode> list){
for(int i = 0; i < list.size() - 1; i++){
list.get(i).right = list.get(i + 1);
list.get(i + 1).left = list.get(i);
}
return list.get(0);
}
公共变量:
public class Solution {
TreeNode pre=null;
TreeNode root=null;
public TreeNode Convert(TreeNode pRootOfTree) {
if (pRootOfTree==null)
return null;
Convert(pRootOfTree.left);
if (root==null){
root=pRootOfTree;
}
if (pre!= null){
pRootOfTree.left=pre;
pre.right=pRootOfTree;
}
pre=pRootOfTree;
Convert(pRootOfTree.right);
return root;
}
}
自己另起,也是公共变量
public class Solution {
TreeNode head = null;
TreeNode cur = head;
public TreeNode Convert(TreeNode pRootOfTree) {
inOrder(pRootOfTree);
return head;
}
public void inOrder(TreeNode root){
if(root == null) return;
inOrder(root.left);
if(head == null) head = root;
if(cur != null){
cur.right = root;
root.left = cur;
}
cur = root;
inOrder(root.right);
}
}