Ejemplo n.º 1
0
// Builds a tree of all the numbers in an array
Node* create_tree(int* array, int size){
    Node* root = create_blank_node();
    root->value = array[0];
    for (int i=1; i < size; i++) {
        Node* node = create_blank_node();
        node->value = array[i];
        insert_node(&root, node);
    }
    return root;
}
Ejemplo n.º 2
0
// Builds a tree of all the numbers in an array
Node* create_tree(int* array, int size){
    struct Node* root = malloc(sizeof(Node));
    int i;
    for(i=0;i<size;i++) {
        struct Node* new_node = create_blank_node();
        new_node->value = array[i];
        //printf("Inserting node with value %d\n", array[i]);
        insert_node(&root, new_node);
    }
    return root;
}
Ejemplo n.º 3
0
// Builds a tree of all the numbers in an array
Node* create_tree(int* array, int size){
    Node *root = NULL;

    for(int i = 0; i < size; i++) {
        Node *current = create_blank_node();
        current->value = array[i];
        insert_node(&root, current);
    }

    return root;
}