Data Structures and Algorithms Review

Vocabulary flashcards covering key terms and definitions related to data structures and algorithms.

Binary Search

A search algorithm that finds the position of a target value within a sorted array, using a divide-and-conquer approach.

Hash Table

A data structure that implements an associative array abstract data type, mapping keys to values using a hash function.

Binary Heap

A complete binary tree that satisfies the heap property, where the parent node is greater than or equal to (max heap) or less than or equal to (min heap) its children.

Collision Resolution

A method used to resolve occurrences where two keys hash to the same index in a hash table.

Insertion Sort

An in-place comparison sorting algorithm that builds a sorted array one item at a time.

Quick Sort

A divide-and-conquer algorithm that selects a 'pivot' element from the list and partitions the other elements into two sub-arrays.

Stable Sort

A sorting algorithm that maintains the relative order of records with equal keys (values).

Tree Traversal

The process of visiting all the nodes of a tree data structure in a specified order.

Pre-order Traversal

A tree traversal method where the root node is processed first, then the left subtree, followed by the right subtree.

Post-order Traversal

A tree traversal method where the left subtree is processed first, then the right subtree, followed by the root node.

Node

A fundamental part of a data structure, which may contain data or a reference to other nodes.

Child Node

A node that has a parent node in a tree structure.

Parent Node

A node that has one or more child nodes in a tree structure.

Leaf Node

A node in a tree that does not have any children.

Binary Search Tree

A node-based binary tree data structure that has the left child less than the parent and the right child greater than the parent.

Load Factor

A measure of how full a hash table is, calculated as the number of stored entries divided by the total number of buckets.

Algorithm Efficiency

A measure of the computational resources required by an algorithm, usually expressed in terms of time or space complexity.

Recursion

A programming technique where a function calls itself directly or indirectly to solve a problem.