+ supprimer_rec(rootNode, value);
+ }
+
+ private boolean hasDataRec(IntNode currentNode, int value) {
+ if (currentNode == null) {
+ return false;
+ }
+ if (value == currentNode.getData()) {
+ return true;
+ }
+ return value < currentNode.getData() ? hasDataRec(currentNode.getLeftNode(), value) : hasDataRec(currentNode.getRightNode(), value);
+ }
+
+ public boolean hasData(int value) {
+ return hasDataRec(rootNote, value);
+ }
+
+ private int findSmallestData(IntNode node) {
+ return node.getLeftNode() == null ? node.getData() : findSmallestData(node.getLeftNode());
+ }
+
+ public afficher_rec(IntNode currentNode) {
+ if (currentNode.getLeftNode() != null) {
+ afficher_rec(currentNode.getLeftNode());
+ } else if (currentNode.getRightNode() != null) {
+ afficher_rec(currentNode.getRightNode());
+ }
+ System.out.println("Valeur dans le noeud : ");
+ }
+
+ public static void main(String[] args) {
+ ArbreBinaire Btree = new ArbreBinaire();
+
+ Btree.inserer(5);
+ Btree.inserer(2);
+ Btree.inserer(7);
+ Btree.inserer(1);
+
+ String Btreeout = Btree.toString();
+ System.out.println(Btreeout);