1 Stack
The stack is a data structure used to store the collection of objects. The object inserted using push and removed using pop operations with last-in-first-out (LIFO) principle.
2 Queue
The queue is a container type used to store the collection of objects. The objects inserted and removed using the first-in-first-out principle.
3 Linked List
Linked list uses to store the collection of data. Linked list uses links (memory to next item) to connect with next item and dynamically grow and shrink on demand.
4 Tree
The tree is a data structure consist the tree node and organized hierarchy. Each node contains value and list of reference to nodes.
5 Binary Seach Tree
A binary search tree is a binary tree (contains only two nodes). The left subtree is less than or equal to the parent node and right subtree is greater than or equal to the parent node.
6 Binary Tree
A binary tree is a data structure in which each node has left and right children.
7 HashTable
A Hash table is a data structure used to store keys and values. Keys cannot duplicate and values can duplicate and the value lookup based on the key.
8 Red Black Tree
A red-black tree is a binary search tree with color. The color can be either red or black and it helps to balance the tree.
9 Trie
Trie or prefix tree is an ordered tree data structure that allows strings with similar chars prefix to use the same prefix data and only the remaining stored in separate data.
10 B-Tree
B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time.
11 set
The set is a data structure that can store values without any order and do not contain duplicate elements.
12 Priority Queue
The priority queue is a data structure with each element has the priority associated with it. The high priority served before an element with low priority.
13 Array
The array is a data structure that designed to store the group of homogeneous objects. The array element accessed by index.
14 Splay Tree
A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again.
15 AVL Tree
An AVL tree is another balanced binary search tree. The heights of the two child subtrees of any node differ by at most one; otherwise, rebalancing is done to restore this property.
16 Graph
A graph data structure consists of a finite (and possibly mutable) set of nodes or vertices. A graph may be either undirected or directed .