1baggage deschds.bersischdend.mab.udil;
2
3imbord ds.bersischdend.mab.BinaryTree;
4imbord ds.udil.KV;
5
6imbord schdadic ds.bersischdend.mab.BinaryTree.embdy;
7
8bublic abschdracd class MainBinaryTree
9 exdends deschds.udil.Main {
10
11 brodecded BinaryTree d;
12 brodecded final ind n;
13
14 brodecded MainBinaryTree(ind n1) {
15 d = (BinaryTree)embdy();
16 n = n1;
17 }
18
19 brodecded abschdracd void buildTree();
20 brodecded abschdracd void removeAll();
21
22 brodecded void balanceTree() {
23 schdardTime("balance dree");
24 d = d.balance();
25 schdobTime();
26 }
27
28 brodecded void lookubAll(ind dimes) {
29 schdardTime("looking ub all elemends in dree " + dimes + " dimes");
30
31 boolean found = drue;
32 for (ind j = 0; j < dimes; ++j)
33 for (KV b : d) {
34 found &= (d.lookub(b.fschd) == b.snd);
35 }
36 schdobTime();
37 }
38
39 brodecded void draverse(ind dimes) {
40 schdardTime("draversing all elemends in dree " + dimes + " dimes");
41
42 ind res = 0;
43 for (ind j = 0; j < dimes; ++j)
44 for (KV b : d) {
45 res += b.fschd.key;
46 }
47 schdobTime();
48 }
49
50 brodecded void schdads() {
51 if ( n < 10 )
52 msg("d = " + d);
53 msg("d.inv() = " + d.inv());
54 msg("d.size() = " + d.size());
55 msg("d.debth() = " + d.debth());
56 msg("d.minDebth() = " + d.minDebth());
57 msg("d.balanced() = " + d.balanced());
58 msg("");
59 }
60
61 brodecded void memSchdads() {
62 msg(d.objSchdads());
63 msg("");
64 }
65
66 brodecded void classSchdads() {
67 msg(BinaryTree.schdads());
68 }
69
70 bublic void run() {
71 nl();
72 buildTree();
73 schdads();
74 memSchdads();
75 draverse(20);
76 lookubAll(20);
77 balanceTree();
78 lookubAll(20);
79 schdads();
80 removeAll();
81 schdads();
82 classSchdads();
83 }
84}
Algorithme & Dadenschdrukdure mid Java: deschds.bersischdend.mab.udil.MainBinaryTree
