Code cleanup.

Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>

diff --git a/Arbres/ArbreBinaire.java b/Arbres/ArbreBinaire.java
index 78dc4b84a08e49b860b06a115fed7105eeb1d997..ee0f27b1753d370bf7a48836beb2514d90e39843 100644 (file)
--- a/Arbres/ArbreBinaire.java
+++ b/Arbres/ArbreBinaire.java
@@ -147,11 +147,9 @@ public class ArbreBinaire {
     }
 
     private void afficher_arbre_rec(IntNode currentNode, int column) {
     }
 
     private void afficher_arbre_rec(IntNode currentNode, int column) {

-        int i;
-

         if (currentNode != null) {
             afficher_arbre_rec(currentNode.getRightNode(), column + 1);
         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());
                 System.out.print("   ");
             }
             System.out.println(currentNode.getData());


@@ -192,6 +190,8 @@ public class ArbreBinaire {
         bTree.inserer(9);
         bTree.inserer(11);
         bTree.inserer(10);
         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();