1. [单选题]二分查找树里查询一个关键字的最坏时间复杂度是______
A. O(n)
B. O(nlogn)
C. O(logn)
D. 不确定
2. [单选题]下列程序的输出结果是______。 class T44 implements Runnable { public void run() { System.out.print in (Thread.currentThread ( ).getName ( ) + "运行" ); } } public class ex44 { public static void main(String[] args) { Thread t1 = new Thread(new T44(), "t1"); Thread t2 = new Thread(new T44 () , "t2"); t1 .setPriority(Thread. MAX_PRIORITY); t2.setPriority(Thread.MIN_PRIORITY); t2. start (); t1 .start (); } }
A. t1 运行 t2 运行
B. t2 运行 t1 运行
C. t1 运行 t1 运行
D. t2 运行 t2 运行
