1 Flashcards
Record
A record is the data structure that stores subitems, often called fields, with a name associated with each subitem.
Array
An array is a data structure that stores an ordered list of items, where each item is directly accessible by a positional index.
Linked list
A linked list is 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 binary tree is 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 hash table is a data structure that stores unordered items by mapping (or hashing) each item to a location in an array.
Heap
A max-heap is a tree that maintains the simple property that a node’s key is greater than or equal to the node’s childrens’ keys. A min-heap is a tree that maintains the simple property that a node’s key is less than or equal to the node’s childrens’ keys.
Graph
A graph is a data structure for representing connections among items, and consists of vertices connected by edges. A vertex represents an item in a graph. An edge represents a connection between two vertices in a graph.
List
A list is an ADT for holding ordered data.
Dynamic array
A dynamic array is an ADT for holding ordered data and allowing indexed access.
Stack
A stack is an ADT in which items are only inserted on or removed from the top of a stack.
Queue
A queue is an ADT in which items are inserted at the end of the queue and removed from the front of the queue.
Deque
A deque (pronounced “deck” and short for double-ended queue) is an ADT in which items can be inserted and removed at both the front and back.
Bag
A bag is an ADT for storing items in which the order does not matter and duplicate items are allowed.
Set
A set is an ADT for a collection of distinct items.
Priority queue
A priority queue is a queue where each item has a priority, and items with higher priority are closer to the front of the queue than items with lower priority.
