Data Structures and Algorithms

Flashcards covering key vocabulary and concepts in Data Structures and Algorithms.

Data Structure

A specialized format for organizing, processing, retrieving, and storing data.

Linear Data Structure

A type of data structure in which elements are arranged in a sequence and form a linear series.

Array

A sequence of a finite set of items of the same data type that are stored contiguously in memory, accessed by an index.

Linked List

A sequence of nodes where each node contains data and a link (pointer) to the next node.

Stack

A linear data structure that follows a Last In First Out (LIFO) order for operations.

Queue

A data structure where items are added at one end (rear) and removed from another end (front), following First In First Out (FIFO) principle.

Binary Tree

A tree data structure in which each node has at most two children referred to as left child and right child.

Binary Search Tree

A binary tree where each node contains elements lesser than itself on the left and elements greater on the right.

AVL Tree

A self-balancing binary search tree where the difference between the heights of left and right subtrees is at most one.

Heap Tree

A binary tree that satisfies the heap property, where the key of parent nodes is greater than or equal to the keys of child nodes.

B Tree

A self-balancing tree data structure that maintains sorted data and allows logarithmic time complexity for search, insert, and delete operations.

Hashing

The transformation of a string into a shorter fixed-length value, which is used for fast data retrieval.

Graph

A collection of points (vertices or nodes) connected by line segments (edges or arcs).

Directed Graph

A graph where each edge has an associated direction, represented as ordered pairs of vertices.

Undirected Graph

A graph in which the edges have no direction, meaning the connections are bidirectional.

Weighted Graph

A graph where each edge is assigned a weight or value, used in calculations like shortest path.

What is a Linear Data Structure?

A data structure where elements are arranged in a sequential manner, allowing traversal in a single direction.

What is a Non-linear Data Structure?

A data structure where elements are stored in a hierarchical form, allowing multiple paths to access data.

What are the Basic Features of a Stack?

A stack is a linear data structure that follows Last In First Out (LIFO) principle, supports push and pop operations, and allows access only to the top element.

What is Reverse Polish Notation (RPN)?

RPN is a mathematical notation where operators follow their operands, allowing for no ambiguity in expression evaluation and eliminating the need for parentheses.