4 * A binary tree is a ordered value tree with only two childs by node
6 public class ArbreBinaire
{
8 private class IntNode
{
10 private IntNode leftIntNode
;
11 private IntNode rightIntNode
;
19 IntNode(int value
, IntNode leftNode
, IntNode rightNode
) {
21 setLeftNode(leftNode
);
22 setRightNode(rightNode
);
25 private int getData() {
29 private void setData(int value
) {
33 private IntNode
getLeftNode() {
37 private void setLeftNode(IntNode leftNode
) {
38 leftIntNode
= leftNode
;
41 private IntNode
getRightNode() {
45 private void setRightNode(IntNode rightNode
) {
46 rightIntNode
= rightNode
;
51 private IntNode rootNode
;
57 private void setRootNode(IntNode node
) {
61 private IntNode
getRootNode() {
65 private boolean isEmpty() {
66 return (getRootNode() == null);
69 public void inserer(int value
) {
73 public void supprimer(int value
) {