题目描述
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
//思路:先中序遍历该BST,然后依次放入list,再对list进行处理,左右指针。
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.ArrayList;
import java.util.Stack;
public class Solution {
public TreeNode Convert(TreeNode pRootOfTree) {
ArrayList<TreeNode> list = new ArrayList<>();
if(pRootOfTree == null){
return null;
}
if(pRootOfTree != null){
Stack<TreeNode> stack = new Stack<>();
while(!stack.isEmpty() || pRootOfTree != null){
if(pRootOfTree != null){
stack.push(pRootOfTree);
pRootOfTree = pRootOfTree.left;
}else{
pRootOfTree = stack.pop();
list.add(pRootOfTree);
pRootOfTree = pRootOfTree.right;
}
}
}
return sort(list);
}
public TreeNode sort(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);
}
}