**一棵二叉树原本是搜索二叉树,但是其中有两个节点调换了位置,使得这棵二叉树不再是搜索二叉树,请找到这两个错误节点并返回他们的值。保证二叉树中结点的值各不相同。
给定一棵树的根结点,请返回两个调换了位置的值,其中小的值在前。**
import java.util.*;
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}*/
public class FindErrorNode {
public int[] findError(TreeNode root) {
// write code here
ArrayList<Integer> list = new ArrayList<Integer>();
changeOrder(root, list);
int[] res = new int[list.size()];
for(int i = 0; i< list.size(); i++){
res[i] = list.get(i);
}
int error1 = 0;
int error2 = 0;
for(int i = 0; i< res.length;i++){
if(res[i]>res[i+1]){
error2 = res[i];
break;
}
}
for(int i = res.length-1; i>0; i--){
if(res[i] < res[i-1]){
error1 = res[i];
break;
}
}
int[] result = new int[]{error1, error2};
return result;
}
//midOrder
public void changeOrder(TreeNode root, ArrayList<Integer> list){
if(root == null)
return ;
changeOrder(root.left, list);
list.add(root.val);
changeOrder(root.right, list);
}
}