repositories
/
TP_POO.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Code cleanup.
[TP_POO.git]
/
Arbres
/
ArbreBinaire.java
diff --git
a/Arbres/ArbreBinaire.java
b/Arbres/ArbreBinaire.java
index c4d84fb2b1a058c70528919717e086723dfe19fe..ee0f27b1753d370bf7a48836beb2514d90e39843 100644
(file)
--- a/
Arbres/ArbreBinaire.java
+++ b/
Arbres/ArbreBinaire.java
@@
-1,7
+1,7
@@
/**
* Binary tree class.
/**
* 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 {
*/
public class ArbreBinaire {
@@
-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 (i
nt 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();