Recursion in C
Recursion Recursion and Iteration are two different concepts of achieving a result by a number of repeated operations. Iteration involves use of for, while and...
Doubly Linked Lists
Doubly Linked lists eliminates below drawbacks of circular lists – not able to traverse backward not able to delete and node given only points to...
Simulation of Josephus Problem using Circular lists
Josephus Problem Josephus problem is that some soldiers are being surrounded by their enemies and there is only one horse to escape i.e. only one...
Dynamic Circular Linked Lists in C
Circular lists eliminates same drawbacks of linear lists. In as circular list it is assumed that items are inserted at the front and the list...
Advantages of Dynamic representation of Lists over its Array implementation
Below are the advantages of Dynamic representation of Lists over its Array implementation – No advanced knowledge of number of nodes is required No memory...
Dynamic Linked Lists as Queues in C
When Dynamic Linked Lists are represented as Queues, the first node represents front of queue given by q.front and last node represents the rear of...
Implementing Dynamic Linked Lists in C
List is a type of dynamic data structure which rectifies certain drawbacks of Stacks and Queues. Lists generally uses the concept of pointers which points...