repositories
/
TP_POO.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Spell fix in comment.
[TP_POO.git]
/
Arbres
/
ArbreBinaire.java
diff --git
a/Arbres/ArbreBinaire.java
b/Arbres/ArbreBinaire.java
index a99b47a201e1b2f04662394ac780b7eb9dfaa6b8..78dc4b84a08e49b860b06a115fed7105eeb1d997 100644
(file)
--- a/
Arbres/ArbreBinaire.java
+++ b/
Arbres/ArbreBinaire.java
@@
-1,7
+1,7
@@
/**
* Binary tree class.
/**
* Binary tree class.
- * A binary tree is a ordered value tree with only two childs
by
node
+ * A binary tree is a ordered value tree with only two childs
per
node
*/
public class ArbreBinaire {
*/
public class ArbreBinaire {
@@
-164,27
+164,37
@@
public class ArbreBinaire {
}
public static void main(String[] args) {
}
public static void main(String[] args) {
- ArbreBinaire
Bt
ree = new ArbreBinaire();
+ ArbreBinaire
bT
ree = new ArbreBinaire();
-
Bt
ree.inserer(2);
-
Bt
ree.inserer(6);
-
Bt
ree.inserer(4);
-
Bt
ree.inserer(5);
-
Bt
ree.inserer(1);
-
Bt
ree.inserer(0);
+
bT
ree.inserer(2);
+
bT
ree.inserer(6);
+
bT
ree.inserer(4);
+
bT
ree.inserer(5);
+
bT
ree.inserer(1);
+
bT
ree.inserer(0);
-
Bt
ree.afficher();
-
Bt
ree.afficher_arbre();
+
bT
ree.afficher();
+
bT
ree.afficher_arbre();
-
Bt
ree.supprimer(4);
+
bT
ree.supprimer(4);
-
Bt
ree.afficher();
-
Bt
ree.afficher_arbre();
+
bT
ree.afficher();
+
bT
ree.afficher_arbre();
-
Bt
ree.supprimer(6);
+
bT
ree.supprimer(6);
- Btree.afficher();
- Btree.afficher_arbre();
+ bTree.afficher();
+ bTree.afficher_arbre();
+
+ bTree.inserer(2);
+ bTree.inserer(7);
+ bTree.inserer(3);
+ bTree.inserer(9);
+ bTree.inserer(11);
+ bTree.inserer(10);
+
+ bTree.afficher();
+ bTree.afficher_arbre();
}
}
}
}