Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{142712,
        author = {Pankaj gaur},
        title = {Stack and queue},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {2},
        number = {6},
        pages = {322-325},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=142712},
        abstract = {An array is a random access data structure, where each element can be accessed directly and in constant time. A typical illustration of random access is a book - each page of the book can be open independently of others. Random access is critical to many algorithms, for example binary search.
A linked list is a sequential access data structure, where each element can be accesed only in particular order. A typical illustration of sequential access is a roll of paper or tape - all prior material must be unrolled in order to get to data you want.
In this note we consider a subcase of sequential data structures, so-called limited access data sturctures.
},
        keywords = {Stack , Queue , Data Structure },
        month = {},
        }