publicbooleanisBst1(TreeNode root){List<TreeNode> list =newArrayList<>();orderList(root,list);boolean flag =true;for(int i =0;i<list.size()-1;i++){if(list.get(i+1).value <= list.get(i).value){//进行节点值判断
flag =false;}}return flag;}publicvoidorderList(TreeNode root,List<TreeNode> list){if(root ==null){return;}orderList(root.left,list);
list.add(root);//存入树节点信息orderList(root.right,list);}