............ struct node {

    int value;

    struct node *next;

};

 

struct node *create(int v);

void append(struct node *root, int v);

void print(struct node *root);

void free_list(struct node *root);

 

//You should return a new pointer pointing to the first element of prepedned list

struct node *prepend(struct node *root, int value);

int get(struct node *root, int index);

 

//Assume that this method will never be called to add a node at position 0

//(third argument was added as correction)

void add(struct node *root, int index, int value);

 

//Assume that this method will never be called to remove a node at position 0

//(function was renamed to avoid conflict)

void remove_node(struct node *root, int index);

 

int find(struct node *root, int value);

 

 

 

..........................................................................