We use the Stack data structure to create a pile of data/information one after another and then process those from top to bottom. Items of a stack are accessed/processed on a Last-in-First-out basis. Stack support push and pop from the top. In this article, we are discussing in detail, the implementation of Stack in JavaScript and TypeScript.
Queue data structures are created for maintaining a queue of tasks or processes, so that we can we can maintain the sequence of the items and process those one by one. First-in-First-out is used for processing a queue. In this article, we are discussing in detail, the implementation of Queue in JavaScript and TypeScript.
A singly linked list is a list of items, where each element has reference to the next element. Elements do not have info of the previous element. So we can only go to the next element while traversing a singly linked list. In this article, we are discussing in detail, the implementation of Singly Linked List in JavaScript and TypeScript.