An array is a structure of fixed size, which can hold items of the same data type. It can be an array of integers, an array of floating-point numbers, an array of strings or even an array of arrays (such as 2-dimensional arrays). Arrays are indexed, meaning that random access is possible.

• Traverse : Go through the elements and print them.
• Search : Search for an element in the array. You can search the element by its value or its index
• Update : Update the value of an existing element at a given index

Inserting elements to an array and deleting elements from an array cannot be done straight away as arrays are fixed in size. If you want to insert an element to an array, first you will have to create a new array with increased size (current size + 1), copy the existing elements and add the new element. The same goes for the deletion with a new array of reduced size.

• Used as the building blocks to build other data structures such as array lists, heaps, hash tables, vectors and matrices.
• Used for different sorting algorithms such as insertion sort, quick sort, bubble sort and merge sort.

A linked list is a sequential structure that consists of a sequence of items in linear order which are linked to each other. Hence, you have to access data sequentially and random access is not possible. Linked lists provide a simple and flexible representation of dynamic sets.

• Elements in a linked list are known as nodes.
• Each node contains a key and a pointer to its successor node, known as next.
• The attribute named head points to the first element of the linked list.
• The last element of the linked list is known as the tail.

• Singly linked list — Traversal of items can be done in the forward direction only.
• Doubly linked list — Traversal of items can be done in both forward and backward directions. Nodes consist of an additional pointer known as prev, pointing to the previous node.
• Circular linked lists — Linked lists where the prev pointer of the head points to the tail and the next pointer of the tail points to the head.

• Search: Find the first element with the key k in the given linked list by a simple linear search and returns a pointer to this element
• Insert: Insert a key to the 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.
• Delete: Removes an element x from a given linked list. You cannot delete a node by a single step. 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.

• Used for symbol table management in compiler design.
• Used in switching between programs using Alt + Tab (implemented using Circular Linked List).

A 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. This structure is named as “stack” because it resembles a real-world stack — a stack of plates.

• Push: Insert an element onto the top of the stack.
• Pop: Delete the topmost element and return it.
• Peek: Return the top element of the stack without deleting it.
• isEmpty: Check if the stack is empty.
• isFull: Check if the stack is full.

Used for expression evaluation (e.g.: a shunting-yard algorithm for parsing and evaluating mathematical expressions). Used to implement function calls in recursion programming.

A queue is a FIFO (First In First Out — the element placed at first can be accessed at first) structure which can be commonly found in many programming languages. This structure is named as "queue" because it resembles a real-world queue — people waiting in a queue.

• Enqueue: Insert an element to the end of the queue.
• Dequeue: Delete the element from the beginning of the queue.

Used to manage threads in multithreading. Used to implement queuing systems (e.g.: priority queues).

A Hash Table is a data structure that stores values which have keys associated with each of them. Furthermore, it supports lookup efficiently if we know the key associated with the value. Hence it is very efficient in inserting and searching, irrespective of the size of the data.

Direct Addressing uses the one-to-one mapping between the values and keys when storing in a table. However, there is a problem with this approach when there is a large number of key-value pairs. The table will be huge with so many records and may be impractical or even impossible to be stored, given the memory available on a typical computer. To avoid this issue we use hash tables.

A special function named the hash function (h) is used to overcome the aforementioned problem in direct addressing. In direct accessing, a value with key k is stored in slot k. Using the hash function, we calculate the index of the table ( slot) to which each value goes. The value calculated using the hash function for a given key is called the hash value which indicates the index of the table to which the value is mapped.

• h: Hash function
• k: Key of which the hash value should be determined
• m: Size of the hash table (number of slots available). A prime value that is not close to an exact power of 2 is a good choice for m.

• Used to implement database indexes.
• Used to implement associative arrays.
• Used to implement the “set” data structure.

A tree is a hierarchical structure where data is organized hierarchically and are linked together. This structure is different from a linked list whereas, in a linked list, items are linked in a linear order. Various types of trees have been developed throughout the past decades, in order to suit certain applications and meet certain constraints. Some examples are binary search tree, B tree, treap, red-black tree, splay tree, AVL tree and n-ary tree.

A binary search tree (BST), as the name suggests, is a binary tree where data is organized in a hierarchical structure. This data structure stores values in sorted order. Every node in a binary search tree comprises the following attributes.

A binary search tree exhibits a unique property that distinguishes it from other trees. This property is known as the ** binary-search-tree property**.

• Binary Trees: Used to implement expression parsers and expression solvers.
• Binary Search Tree: used in many search applications where data are constantly entering and leaving.
• Heaps: used by JVM (Java Virtual Machine) to store Java objects.
• Treaps: used in wireless networking.

A Heap is a special case of a binary tree where the parent nodes are compared to their children with their values and are arranged accordingly.

Heaps can be of 2 types.

• Min Heap — the key of the parent is less than or equal to those of its children. This is called the min-heap property. The root will contain the minimum value of the heap.
• Max Heap — the key of the parent is greater than or equal to those of its children. This is called the max-heap property. The root will contain the maximum value of the heap.

• Used in heapsort algorithm.
• Used to implement priority queues as the priority values can be ordered according to the heap property where the heap can be implemented using an array.
• Queue functions can be implemented using heaps within O(log n) time.
• Used to find the kᵗʰ smallest (or largest) value in a given array.

A graph consists of a finite set of vertices or nodes and a set of edges connecting these vertices.

The order of a graph is the number of vertices in the graph. The size of a graph is the number of edges in the graph.

Two nodes are said to be adjacent if they are connected to each other by the same edge.

A graph G is said to be a directed graph if all its edges have a direction indicating what is the start vertex and what is the end vertex. We say that (u, v) is an incident from or leaves vertex u and is incident to or enters vertex v. Self-loops: Edges from a vertex to itself.

A graph G is said to be an undirected graph if all its edges have no direction. It can go in both ways between the two vertices.

If a vertex is not connected to any other node in the graph, it is said to be isolated.

• Used to represent social media networks. Each user is a vertex, and when users connect they create an edge.
• Used to represent web pages and links by search engines. Web pages on the internet are linked to each other by hyperlinks. Each page is a vertex and the hyperlink between two pages is an edge. Used for Page Ranking in Google.
• Used to represent locations and routes in GPS. Locations are vertices and the routes connecting locations are edges. Used to calculate the shortest route between two locations.

A trie is a tree-like information retrieval data structure whose nodes store the letters of an alphabet. It is also known as a digital tree or a radix tree or prefix tree.

Trie is an efficient information retrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length). If we store keys in binary search tree, a well balanced BST will need time proportional to M * log N, where M is maximum string length and N is number of keys in tree. Using Trie, we can search the key in O(M) time.

1. Standard Trie : It is an ordered tree like data structure.

• Each node but the root is labeled with a character.
• The children of a node are alphabetically ordered.
• The The paths from the external node to the root yield the strings of S.
• The last node of every key or word is used to mark the end of word or node.

2. Compressed Trie : It is used to achieve space optimization. A Compressed Trie is an advanced version of the standard trie.

• Tires with nodes of degree at least 2
• It consists of grouping, re-grouping and un-grouping of keys of characters.
• While performing the insertion operation, it may be required to un-group the already grouped characters.
• While performing the deletion operation, it may be required to re-group the already grouped characters.
• Obtained by standard tries by compressing chains of redundant nodes.

3. Suffix Trie : A Suffix Trie is an advanced version of the compressed trie.

• A suffix tire is a compressed trie for all the suffixes of a text.
• Suffix tire are a space-efficient data structure to store a string that allows many kinds of queries to be answered quickly.

With Trie, we can insert and find strings in O(L) time where L represent the length of a single word. This is obviously faster than BST. This is also faster than Hashing because of the ways it is implemented. We do not need to compute any hash function. Another advantage of Trie is, we can easily print all words in alphabetical order which is not easily possible with hashing.

1. Auto Complete
2. Spell Checkers
3. Longest Prefix Matching
4. Browser History

Dynamic programming is a technique that breaks the problems into sub-problems, and saves the result for future purposes so that we do not need to compute the result again. The subproblems are optimized to optimize the overall solution is known as optimal substructure property. The main use of dynamic programming is to solve optimization problems. Here, optimization problems mean that when we are trying to find out the minimum or the maximum solution of a problem. The dynamic programming guarantees to find the optimal solution of a problem if the solution exists.

The reference is taken from this link - Sourav Saini😊