/**
* 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 {
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));
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) {
}
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());
bTree.inserer(9);
bTree.inserer(11);
bTree.inserer(10);
+ bTree.inserer(8);
+ bTree.inserer(4);
bTree.afficher();
bTree.afficher_arbre();