diff --git a/source_codes/arbres_binaires/arbre_binaire.c b/source_codes/arbres_binaires/arbre_binaire.c index 0ad59ad09fc2d9ef4a7875d55470846616145774..4a6a655d14b30ff00b0b96b2ba857c4df0086c0e 100644 --- a/source_codes/arbres_binaires/arbre_binaire.c +++ b/source_codes/arbres_binaires/arbre_binaire.c @@ -107,6 +107,8 @@ bool arbre_delete(arbre *tree, int cle) { nd->key = val; return true; } + + return false; } void arbre_print(arbre tree, int N) { diff --git a/source_codes/arbres_binaires/bin_tree.c b/source_codes/arbres_binaires/bin_tree.c index 613040e8b13e783d7e36d0fc654cf5709591e44f..7b2aa0f9240468ca4da0e2655f2cfaafd1477ed6 100644 --- a/source_codes/arbres_binaires/bin_tree.c +++ b/source_codes/arbres_binaires/bin_tree.c @@ -130,6 +130,7 @@ bool arbre_delete_bis(arbre *tree, cle c) { return true; } } + return false; } void arbre_print(arbre tree, int N) { diff --git a/source_codes/arbres_binaires/bin_tree_main.c b/source_codes/arbres_binaires/bin_tree_main.c index 985a318bf7cefff229ef46f9a91ccc3c139f7a98..b5500ddf3bd39e904bacf13501a9a479fb0974e2 100644 --- a/source_codes/arbres_binaires/bin_tree_main.c +++ b/source_codes/arbres_binaires/bin_tree_main.c @@ -4,19 +4,20 @@ #include <stdlib.h> void main() { - bool b; - int val; + bool b = false; arbre tree = NULL; arbre_print(tree, 1); do { printf("insert val = "); + int val; scanf("%d", &val); - b = arbre_insert(&tree, val); + b = arbre_insert(tree, val); arbre_print(tree, 1); } while (b); node *nd; do { printf("delete val = "); + int val; scanf("%d", &val); b = arbre_delete(&tree, val); arbre_print(tree, 1); diff --git a/source_codes/arbres_binaires/bin_tree_part.c b/source_codes/arbres_binaires/bin_tree_part.c index 68190dafb5363fd332bab4017787051584751635..dbdd5d5d4516cd9f37d7a458edefb1c840873d01 100644 --- a/source_codes/arbres_binaires/bin_tree_part.c +++ b/source_codes/arbres_binaires/bin_tree_part.c @@ -86,6 +86,7 @@ bool arbre_delete(arbre *tree, int cle) { return true; } } + return false; } void arbre_print(arbre tree, int N) {