#fridolin <3 - ✅-construire-un-arbre-à-partir-dun-tableau

bintree.c

#include "bintree.h"

t_tree createTreeFromArray(int *values,int size)
{
    t_tree t;
    t.root = createNodeFromArray(values, size, 0);
    return t;
}

17:27

node.c

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

p_node createNodeFromArray(int *values, int size, int idx)
{
    p_node node = createNode(values[idx]);
    if (idx * 2 + 1 < size)
        node->left = createNodeFromArray(values, size, idx * 2 + 1);
    if (idx * 2 + 2 < size)
        node->right = createNodeFromArray(values, size, idx * 2 + 2);
    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;
}