INFORMATION A data structure is a specialized format for organizing, processing, retrieving and storing data. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways.

INFORMATION In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence. There are several types of linked lists: Singly linked list Doubly linked list Circular linked list Circular doubly linked list IMPLEMENTATION C Language .

INFORMATION Stack is a linear Data Structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first, comes out last. IMPLEMENTATION C Language .h file typedef struct node_s { void *value; struct node_s *next; } node_t, *stack_t; /* informations */ unsigned int stack_get_size(stack_t stack); bool stack_is_empty(stack_t stack); /* Modifications */ bool stack_push(stack_t *stack_ptr, void *elem); bool stack_pop(stack_t *stack_ptr); void stack_clear(stack_t *stack_ptr); /* Access */ void *stack_top(stack_t stack); .