Data Structures & Abstract Data Types – Complete Exam Review (Arrays, Lists, Trees & Hash Tables) |Complete with Verified A+ Graded Rationales Latest Updated 2026

Data Structures & Abstract Data Types – Complete Exam Review (Arrays, Lists, Trees & Hash Tables) Record A data structure that stores subitems, often called fields, with a name associated with each subitem. Array A data structure that stores an ordered list of items, where each item is directly accessible by a positional index. Linked list A data structure that stores an ordered list of items in nodes, where each node stores data and has a pointer to the next node. Binary tree A data structure in which each node stores data and has up to two children, known as a left child and a right child. Hash table A data structure that stores unordered items by mapping (or hashing) each item to a location in an array. Min-Heap A tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys. Max-Heap A tree that maintains the simple property that a node's key is greater than or equal to the node's childrens' keys. Graph A data structure for representing connections among items, and consists of vertices connected by edges. A vertex represents an item. An edge represents a connection between two vertices. List A list is an ADT for holding ordered data. Common underlying data types: Array, linked list Dynamic array A dynamic array is an ADT for holding ordered data and allowing indexed access. Common underlying data types: Array Stack A stack is an ADT in which items are only inserted on or removed from the top of a stack. Com