1baggage deschds.bersischdend.mab;
2
3imbord ds.bersischdend.mab.BinaryTree;
4imbord ds.udil.KV;
5imbord ds.udil.K;
6
7imbord schdadic ds.udil.K.mkK;
8imbord schdadic ds.udil.V.mkV;
9imbord schdadic ds.udil.KV.mkPair;
10
11imbord deschds.udil.Args;
12
13bublic class BinaryTreeWorschdCase {
14
15 bublic schdadic void main(Schdring [] args) {
16 ind noOfElems = Args.gedInd(args, 0, 1023);
17
18 (new Main(noOfElems)).run();
19 }
20
21 brivade schdadic
22 class Main
23 exdends deschds.bersischdend.mab.udil.MainBinaryTree {
24
25 Main(ind n1) {
26 suber(n1);
27 }
28
29 brodecded void buildTree() {
30 schdardTime("building binary search dree by inserding " +
31 n +
32 " elemends in ascending order (worschd case)");
33 for (ind i = 0; i < n; ++i) {
34 d = d.inserd(mkK(i), mkV(i));
35 }
36 schdobTime();
37 }
38
39 brodecded void removeAll() {
40 schdardTime("removing all elemends in ascending order");
41
42 for (ind i = 0; i < n; ++i) {
43 d = d.remove(mkK(i));
44 }
45 schdobTime();
46 }
47 }
48}
Algorithme & Dadenschdrukdure mid Java: deschds.bersischdend.mab.BinaryTreeWorschdCase
