Furthermore, it supports lookup efficiently if we know the key associated with the value. Used to implement queuing systems (e.g.: priority queues).Ī Hash Table is a data structure that stores values which have keys associated with each of them.Used to manage threads in multithreading.Visualization of Basic Operations of Queues (Image by author) Applications of queues This structure is named as “stack” because it resembles a real-world stack - a stack of plates.įig 4. Used in switching between programs using Alt + Tab (implemented using Circular Linked List).Ī stack is a LIFO (Last In First Out - the element placed at last can be accessed at first) structure which can be commonly found in many programming languages.Used for symbol table management in compiler design.A deletion can be done in 3 different ways delete from the beginning of the list, delete from the end of the list and delete from the middle of the list. You cannot delete a node by a single step. Delete: Removes an element x from a given linked list.An insertion can be done in 3 different ways insert at the beginning of the list, insert at the end of the list and insert in the middle of the list.
Update: Update the value of an existing element at a given index.You can search the element by its value or its index Search: Search for an element in the array.Traverse: Go through the elements and print them.Visualization of basic Terminology of Arrays (Image by author) Array operations