C949 WGU Terminology|72 Questions With 100% Correct Answers.

record - data structure that stores subitems, with a name associated with each subitem array - a data structure that stores an ordered list of items, with each item is directly accessible by a positional index homogeneous data elements linked list - data structure that stores *ordered* list of items in nodes, where each node stores data and has a pointer to the next node; can have multiple subitems binary tree - A data structure that consists of nodes, with one root node at the base of the tree, and two nodes (left child and right child) extending from the root, and from each child node can have no children, single left or right, or both right and left hash table - data structure that stores *unordered* items by mapping (or hashing) each item to a location in an array 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 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 graph - data structure for representing connections among items, and consists of vertices connected by edges vertice - part of a graph the represents an item in a graphedge - part of a graph that represents a connection between to vertices in a graph what is an advantage of a linked list over an array? - when inserting a new item at the beginning it causes no shift to the data ADT (Abstract data Type) - data type described by predefined user operations, such as "insert data at rear", without indication how each operation is implemented list - ADT for holding ordered data stack - ADT which items are only inserted on or removed from the top of a stack LIFO Queue - ADT in which items are inserted at the end of the queue and removed from the front of the queue FIFO deque ("deck") - ADT in which items can be removed at both the front and back