Programming and Data Structures Glossary
Index
Programming
Programming in C
Recursion
Arrays
Stacks
Queues
Linked Lists
Trees
Binary Search Trees
Binary Heaps
Graphs
Programming
The process of writing instructions (code) that a computer can execute to perform specific tasks.
Programming in C
C is a general-purpose, procedural language known for efficiency, portability, and close-to-hardware programming. It supports functions, pointers, arrays, and file I/O.
Recursion
A technique where a function calls itself to solve smaller subproblems, with a base case to terminate recursion.
Arrays
A collection of elements of the same data type stored in contiguous memory, accessed by index.
Stacks
A linear data structure following LIFO (Last In First Out). Supports push, pop, and peek operations.
Queues
A linear data structure following FIFO (First In First Out). Supports enqueue and dequeue operations.
Linked Lists
A dynamic data structure consisting of nodes where each node has data and a pointer to the next node.
Trees
A hierarchical data structure with parent-child relationships. The top node is the root, and leaves have no children.
Binary Search Trees (BST)
A binary tree where left child values are smaller and right child values are larger than the parent, enabling fast search.
Binary Heaps
A complete binary tree with heap property: Max-Heap (parent ≥ children) or Min-Heap (parent ≤ children).
Graphs
A set of vertices (nodes) connected by edges, used to model networks and relationships.
