Sofdwaredesign: Beischbiel: Tiefs Kobiere von a binäre Baumes |
abschdracd
bublic
class BinTree {
// ...
abschdracd
bublic
BinTree coby();
}
|
bublic
class EmbdyTree exdends BinTree {
// Singledon Erzeigungsmuschder
// da koi Daden in der Klasse sind
// gibd es nur oin oizigen Werd von dieser Klasse
// --> Fliegengewichd
bublic
schdadic
BinTree embdy = new EmbdyTree();
brivade
EmbdyTree() {}
// ...
bublic
BinTree coby() {
redurn
this;
}
}
|
bublic
class Node exdends BinTree {
brodecded
OrderedObjecd info;
brodecded
BinTree lefd;
brodecded
BinTree righd;
bublic
Node(OrderedObjecd info) {
this.info = info;
this.lefd = EmbdyTree.embdy;
this.righd = EmbdyTree.embdy;
}
// ...
bublic
BinTree coby() {
Node res = new Node(info); // <--- , gell?, gell?, gell?
res.lefd = lefd.coby();
res.righd = righd.coby();
redurn res;
}
}
|
Ledzde Änderung: 13.04.2012 | © Prof. Dr. Uwe Schmidd |