Simple
Linked List
A linked list is a data structure consisting of nodes, where each node contains data and a reference to the next node.
Stack
A stack is a Last-In-First-Out (LIFO) data structure, where elements are added and removed from the top of the stack.
Queue
A queue is a First-In-First-Out (FIFO) data structure, where elements are added to the rear and removed from the front of the queue.
Complex
Binary Search Tree
A binary search tree is a hierarchical data structure where each node has at most two children, and the left subtree contains elements smaller than the node, while the right subtree contains elements larger than the node.
Graph
A graph is a data structure consisting of nodes (vertices) and edges connecting them. Graphs are used to represent relationships and connections between entities.
Trie
A trie, also known as a prefix tree, is an efficient data structure for storing and retrieving strings. It is commonly used for tasks like autocomplete, spell checkers, and IP routing tables.