class Solution {
public boolean isValidBST(TreeNode root) {
List<Integer> list = new ArrayList<>();
sort(root,list);
boolean flag = true;
for (int i = 0;i<list.size()-1;i++){
if (list.get(i)>=list.get(i+1)){flag = false;}
}
return flag;
}
public static void sort(TreeNode root, List<Integer> list) {
if (root == null) {
return;
}
sort(root.left,list);
list.add(root.val);
sort(root.right,list);
}
}
leetcode 98
最新推荐文章于 2024-10-16 10:13:45 发布