Compare two linked lists A and B Return 1 if they are identical and 0 if they are not. Node is defined as struct Node { int data; st

Initially val is 1

Delete Node at a given position in a linked list Node is defined as struct Node { int data; struct Node *next; } */

Insert Node at the begining of a linked list Initially head pointer argument could be NULL for empty list Node is defined as struct Node {

Insert Node at the end of a linked list head pointer input could be NULL as well for empty list Node is defined as struct Node { int data

(1, 0) -> null

* NULL <-2--> <-4--> <-6--> NULL * NULL <--2-> <-4--> <-6--> NULL * NULL <--2-> <--4-> <-6--> NULL

Print elements of a linked list in reverse order as standard output head pointer could be NULL as well for empty list Node is defined as struct