1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
|
public class Noeud<T> implements BinTree<T> {
private T root;
private BinTree<T> left;
private BinTree<T> right;
public Noeud(T r, BinTree<T> g, BinTree<T> d){
root = r;
left = g;
right = d;
}
public boolean estVide(){
return false;
}
public T racine(){
return root;
}
public BinTree<T> sag(){
return left;
}
public BinTree<T> sad(){
return right;
}
public int hauteur(){
int g = left.hauteur();
int d = right.hauteur();
int res = (g>d ? g:d);
return res+1;
}
public int taille(){
return 1+left.taille()+right.taille();
}
public String affichage(){
return "["+root+","+left.affichage()+","+right.affichage()+"]";
}
public void imprime(){
for (int i=0; i<1; i++){
System.out.println(" "+root);
}
for (int j=1; j<2; j++){
System.out.println(" / \\ ");
}
for (int j=2; j<3; j++){
System.out.println();
}
}
} |
Partager