X-Git-Url: https://git.piment-noir.org/?p=TP_POO.git;a=blobdiff_plain;f=Arbres%2FArbreBinaire.java;h=fc19203a7e4b9025a49e3628be08079abc12629e;hp=c4d84fb2b1a058c70528919717e086723dfe19fe;hb=a8276a31e5cfa00657738bb5803438fa82752d15;hpb=289395c5957b8dcff698c80b1cc866cf31139a24

diff --git a/Arbres/ArbreBinaire.java b/Arbres/ArbreBinaire.java
index c4d84fb..fc19203 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 {
 
@@ -69,7 +69,8 @@ public class ArbreBinaire {
     private IntNode inserer_rec(IntNode currentNode, int value) {
         if (currentNode == null) {
             return new IntNode(value);
-        } else if (value < currentNode.getData()) {
+        }
+        if (value < currentNode.getData()) {
             currentNode.setLeftNode(inserer_rec(currentNode.getLeftNode(), value));
         } else if (value > currentNode.getData()) {
             currentNode.setRightNode(inserer_rec(currentNode.getRightNode(), value));
@@ -84,7 +85,8 @@ public class ArbreBinaire {
     private IntNode supprimer_rec(IntNode currentNode, int value) {
         if (currentNode == null) {
             return null;
-        } else if (value == currentNode.getData()) {
+        }
+        if (value == currentNode.getData()) {
             if (currentNode.getLeftNode() == null && currentNode.getRightNode() == null) {
                 return null;
             } else if (currentNode.getRightNode() == null) {
@@ -147,11 +149,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());
@@ -192,6 +192,8 @@ public class ArbreBinaire {
         bTree.inserer(9);
         bTree.inserer(11);
         bTree.inserer(10);
+        bTree.inserer(8);
+        bTree.inserer(4);
 
         bTree.afficher();
         bTree.afficher_arbre();