nikmis

/* This implementation is a highly 
 * modified version taken from the book
 * Algorithm Design Manual - Skiena.
 */

#include <stdio.h> 
#include <stdlib.h> 
#include "list.h" 
 
void initList(list **l) 

nikmis

typedef struct list
{
        int item;
        struct list *next;
} list;

/* l - Head of the list
 * node - Node to be deleted from the list.
 */
void listDeleteByNode(list **l, list *node)

nikmis

#include <stdio.h>

int main()
{
    printf("Hello World");
    return 0;
}