linkedList.c

#include <stdio.h>
#include <stdlib.h>
#include "linkedList.h"


void allocate(node* *p){
    *p = malloc(sizeof(node));
};


cell * paragraph( node *p ){
    return p->pragraph;
};

void assignaddr(node *p , node * add){
    p->next = add ;
};

node * next(node *p){
    return p->next ;
};
void insertNewParagraph(node * * head , node * newParagraph , cell * paragraphTree){
    node *start = *head;
    allocate(&newParagraph);
    if(*head == NULL){
        
        *head = newParagraph ; 
        (*head)->next = NULL ; 
        (*head)->pragraph = paragraphTree ;
    }else{
    while (start->next)
        {
            start = next(start) ; 
        }
    start->next = newParagraph ; 
    newParagraph->next = NULL ; 
    newParagraph->pragraph = paragraphTree ; 
    }
  
}

void freeList(node * head){
	if(head == NULL){
		return ;
	}
	node * current = head ; 
	node * prev = head ; 
	while(current != NULL){
		prev = current ;
        current = current->next;
		freeTree(prev->pragraph);  
		free(prev);
	}
}
void freeFile(node ** head){
	if(head == NULL){
		return ;
	}
	node * current = head[0] ; 
	node * prev = head[0] ;
	int i = 0 ;  
	while(current != NULL){
		prev = current ; 
        i++;
		current = head[i] ;
		freeList(prev);
	}
	free(head);
}