DATA STRUCTURES

Data Structure

A way of organizing and storing data efficiently for access and modification.

Abstract Data Type (ADT)

A model specifying data type, supported operations, and operation parameters.

Algorithm

A step-by-step procedure for task completion in a finite time.

Array

Collection of elements stored in contiguous memory locations, identified by index or key.

Linked List

Linear collection of nodes where each node points to the next via a pointer.

Stack

Collection supporting last-in, first-out (LIFO) insertion and deletion.

Queue

Collection supporting first-in, first-out (FIFO) insertion and deletion.

Tree

Hierarchical structure with nodes, a root node, and children sub-nodes.

Binary Tree

Tree structure where each node has at most two children.

Binary Search Tree (BST)

Binary tree where left child has values less and right child has values greater than the parent node.

Heap

Tree-based structure satisfying the heap property, with max heap having node value greater than or equal to children's values.

Graph

Collection of vertices (nodes) connected by edges.

Hash Table

Data structure mapping keys to values for efficient lookup.