题目描述
输入一棵二叉搜索树
import java.util.ArrayList;
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
ArrayList<TreeNode> array = new ArrayList<>();
public TreeNode Convert(TreeNode pRootOfTree) {
if (pRootOfTree == null) {
return null;
}
inorder(pRootOfTree);
int len = array.size();
for (int i = 0; i < len; i++) {
if (i == 0) {
array.get(i).left = null;
} else {
array.get(i).left = array.get(i - 1);
}
if(i == len -1){
array.get(i).right = null;
}else{
array.get(i).right = array.get(i + 1);
}
}
return array.get(0);
}
public void inorder(TreeNode head) {
if(head == null){
return;
}
inorder(head.left);
array.add(head);
inorder(head.right);
}
}
,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。