Understanding and implementing a doubly linked list will be much easier if one understands the concept of a single linked list. If you haven’t read my previous post on the single linked list, I recommend you to do that. In this post, I will only highlight the difference between a single and doubly linked list,
As the name implies, a linked list is a list of items (referred to as nodes). Unlike an array, the memory allocation for the nodes of a linked list is not contiguous. In simple linked list (i.e. uni-direction), a node has two attributes. Its value. A reference to the next node in the list. For
Implementation of stacks and queues in JavaScript is straightforward. We can use the existing Array object and its method to simulate stacks and queue behaviour. Stacks and queues get the contiguous memory allocation. Elements of stack and queue get the memory (allocation) next to each other. Unlike low-level language C, we do not explicitly create
