X-Git-Url: https://git.piment-noir.org/?p=TP_POO.git;a=blobdiff_plain;f=Arbres%2FArbreBinaire.java;h=78dc4b84a08e49b860b06a115fed7105eeb1d997;hp=8f79d28c48379d5f5aafab9d322f14b8a166b713;hb=a7b1affa52f8145a446a8314a65c63aa22059184;hpb=42256966014a8bd9c55ac07f67404105c8003699 diff --git a/Arbres/ArbreBinaire.java b/Arbres/ArbreBinaire.java index 8f79d28..78dc4b8 100644 --- a/Arbres/ArbreBinaire.java +++ b/Arbres/ArbreBinaire.java @@ -1,7 +1,7 @@ /** * 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 { @@ -164,37 +164,37 @@ public class ArbreBinaire { } public static void main(String[] args) { - ArbreBinaire Btree = new ArbreBinaire(); + ArbreBinaire bTree = new ArbreBinaire(); - Btree.inserer(2); - Btree.inserer(6); - Btree.inserer(4); - Btree.inserer(5); - Btree.inserer(1); - Btree.inserer(0); + bTree.inserer(2); + bTree.inserer(6); + bTree.inserer(4); + bTree.inserer(5); + bTree.inserer(1); + bTree.inserer(0); - Btree.afficher(); - Btree.afficher_arbre(); + bTree.afficher(); + bTree.afficher_arbre(); - Btree.supprimer(4); + bTree.supprimer(4); - Btree.afficher(); - Btree.afficher_arbre(); + bTree.afficher(); + bTree.afficher_arbre(); - Btree.supprimer(6); + bTree.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.inserer(2); + bTree.inserer(7); + bTree.inserer(3); + bTree.inserer(9); + bTree.inserer(11); + bTree.inserer(10); - Btree.afficher(); - Btree.afficher_arbre(); + bTree.afficher(); + bTree.afficher_arbre(); } }