Array

Dynamic VS Static Array

Associative Array

Sparse Array

Prefix and Suffix Array

Linked Lists

A Linked list is a dynamic data structure which can grow or shrink on demand.

It is made up of a sequence of nodes.

• These nodes are not stored contiguously in memory but instead each nodes stores a link to the next node. Thus each node has a link that points to the next node in the list.

The number of nodes in a linked list is not fixed and thus the list can grow or shrink on demand. This dynamic nature is very useful when we need to deal with an unknown number of objects.

Among all the nodes in the linked list the first node is specified as a head node, and the last node will be the tail node.

<aside> 💡 In-case the list only has one node, the head and tail node will be the same node. To specify these we use head and tail node pointers.

</aside>

There are various types of linked list:

• Singly Linked List
• Doubly Linked List
• Circular Linked List
• Doubly Circular Linked List
• XOR Linked List
• Skip List