Linked Lists
Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
Write a C program to implement a Generic Linked List.
How would you detect a loop in a linked list? Write a C program to detect a loop in a linked list.
How do you find the middle of a linked list? Write a C program to return the middle of a linked list
Write a C program to return the nth node from the end of a linked list.
Implement a double linked list using a single pointer
Implement
memmove(void *dest,void *from,size_t size). What is the difference between memmove and memcpy()
myprintf()