#fridolin <3 - ✅-construire-un-abr-équilibré-à-partir-dun-tableau-de-valeurs-triées

main.c

#include <stdio.h>
#include "bintree.h"


int main()
{
    int tab0[1]= {42};
    int tab1[3] = {6,17,41};
    int tab2[7] = {-3,-2,-1,0,1,2,3};
    int tab3[15] = {2,5,6,11,13,17,19,22,29,33,34,37,44,49,50};
    t_tree t0 = createAVL(tab0, 1);
    displayTree(t0);
    t_tree t1 = createAVL(tab1, 3);
    displayTree(t1);
    t_tree t2 = createAVL(tab2, 7);
    displayTree(t2);
    t_tree t3 = createAVL(tab3, 15);
    displayTree(t3);
    return 0;
}

16:52

bintree.c

#include <stdlib.h>
#include "bintree.h"

t_tree createAVL(int *values, int size)
{
    t_tree t;
    t.root = createNodeAVL(values, 0, size - 1);
    return t;
}

(edited)

16:53

node.c

//
// Created by flasque on 26/06/2022.
//
#include <stdlib.h>
#include <stdio.h>
#include "node.h"

p_node createNodeAVL(int *values, int start, int end)
{
    p_node node = NULL;
    int mid = (start + end) / 2;

    if (start <= end)
    {
        node = createNode(values[mid]);
        node->left = createNodeAVL(values, start, mid - 1);
        node->right = createNodeAVL(values, mid + 1, end);
    }
    return node;
}

p_node createNode(int val)
{
    p_node nouv;

    nouv = (p_node)malloc(sizeof(t_node));
    nouv->value = val;
    nouv->left = nouv->right = NULL;

    return nouv;
}