In computer science, a is a particular way of storing and organizing data in a computer so that it can be used efficiently.
Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers.
1. An example of queue using Array
2.Circular Queue implementation
3. Singly Link List Implementation --- C code
4.Doubly Linked list Implementation--- C code
