X-Git-Url: https://git.piment-noir.org/?p=TP_POO.git;a=blobdiff_plain;f=Arbres%2FArbreBinaire.java;h=ee0f27b1753d370bf7a48836beb2514d90e39843;hp=a99b47a201e1b2f04662394ac780b7eb9dfaa6b8;hb=dd16cbd60794f33058221497c7b2f4007c0cc1d2;hpb=5b834ba1cac88e2d82f3f7c0abc520763ae4ecd3

diff --git a/Arbres/ArbreBinaire.java b/Arbres/ArbreBinaire.java
index a99b47a..ee0f27b 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 {
 
@@ -147,11 +147,9 @@ public class ArbreBinaire {
     }
 
     private void afficher_arbre_rec(IntNode currentNode, int column) {
-        int i;
-
         if (currentNode != null) {
             afficher_arbre_rec(currentNode.getRightNode(), column + 1);
-            for (i = 0; i < column; i++) {
+            for (int i = 0; i < column; i++) {
                 System.out.print("   ");
             }
             System.out.println(currentNode.getData());
@@ -164,27 +162,39 @@ 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.afficher();
+        bTree.afficher_arbre();
 
-        Btree.inserer(2);
-        Btree.inserer(6);
-        Btree.inserer(4);
-        Btree.inserer(5);
-        Btree.inserer(1);
-        Btree.inserer(0);
+        bTree.supprimer(4);
 
-        Btree.afficher();
-        Btree.afficher_arbre();
+        bTree.afficher();
+        bTree.afficher_arbre();
 
-        Btree.supprimer(4);
+        bTree.supprimer(6);
 
-        Btree.afficher();
-        Btree.afficher_arbre();
+        bTree.afficher();
+        bTree.afficher_arbre();
 
-        Btree.supprimer(6);
+        bTree.inserer(2);
+        bTree.inserer(7);
+        bTree.inserer(3);
+        bTree.inserer(9);
+        bTree.inserer(11);
+        bTree.inserer(10);
+        bTree.inserer(8);
+        bTree.inserer(4);
 
-        Btree.afficher();
-        Btree.afficher_arbre();
+        bTree.afficher();
+        bTree.afficher_arbre();
     }
 
 }