package info.frady.real;
import java.util.Arrays;
public class BinaryTreePra {
//练习下binarytree的代码
static int[] tree_max;//区间最大值的模板代码
static int[] arrN;
static int[] tree_min;//最小值
public static void main(String[] args) {
//int[] nodes=new int[]{1,2,3,4,5,6,7,8,9};
arrN=new int[]{1,2,3,4,12,6,7,8,9};
initTree();
System.out.println(Arrays.toString(tree_max));
System.out.println(Arrays.toString(tree_min));
int fromIndex=16;
System.out.println(fromIndex);
System.out.println(query_max(fromIndex+1,fromIndex+1));// 1
System.out.println(query_max(fromIndex+1,fromIndex+2));// 2
System.out.println(query_max(fromIndex+5,fromIndex+9));// 9
System.out.println(query_min(fromIndex+1,fromIndex+1));// 1
System.out.println(query_min(fromIndex+1,fromIndex+2));// 2
System.out.println(query_min(fromIndex+5,fromInd
SW练习_标准binarytree_求区间最大值
最新推荐文章于 2022-02-24 09:59:45 发布