Data Structures

Study essential data structures like arrays, lists, and trees.

Sample Cards

Data Structure

A way of organizing and storing data so it can be accessed and modified efficiently.

Array

A data structure that stores elements in a linear order and allows for efficient access and modif...

Hash Table

A data structure that stores key-value pairs and allows for fast data retrieval.

Stack

A collection of elements that follows the Last In, First Out (LIFO) principle.

Queue

A collection of elements that follows the First In, First Out (FIFO) principle.

Primitive Data Types

Simple data types that include integers, floats, and characters.

Composite Data Types

Data types that combine primitive data types like arrays and structures.

Linked List

A linear data structure where each element points to the next.

Data Structures Flashcards

Looking to expand your skills in Programming? Look no further! These flashcards are designed to help you learn and retain information in a fun and engaging way.

Study With Rememble

Study With Rememble

Rememble is a free flashcard app that helps you learn and retain information in a fun and engaging way. With Rememble, you can create your own flashcards or choose from thousands of pre-made decks in a variety of subjects.

Whether you're studying for a test, learning a new language, or just want to expand your knowledge, Rememble has you covered. Sign up today and start learning!

What's in this deck?

Data Structure

A way of organizing and storing data so it can be accessed and modified efficiently.

A way of organizing and storing data so it can be accessed and modified efficiently.

Data Structure

Array

A data structure that stores elements in a linear order and allows for efficient access and modification.

A data structure that stores elements in a linear order and allows for efficient access and modification.

Array

Hash Table

A data structure that stores key-value pairs and allows for fast data retrieval.

A data structure that stores key-value pairs and allows for fast data retrieval.

Hash Table

Stack

A collection of elements that follows the Last In, First Out (LIFO) principle.

A collection of elements that follows the Last In, First Out (LIFO) principle.

Stack

Queue

A collection of elements that follows the First In, First Out (FIFO) principle.

A collection of elements that follows the First In, First Out (FIFO) principle.

Queue

Primitive Data Types

Simple data types that include integers, floats, and characters.

Simple data types that include integers, floats, and characters.

Primitive Data Types

Composite Data Types

Data types that combine primitive data types like arrays and structures.

Data types that combine primitive data types like arrays and structures.

Composite Data Types

Linked List

A linear data structure where each element points to the next.

A linear data structure where each element points to the next.

Linked List

Singly Linked List

A type of linked list where each node points only to the next node.

A type of linked list where each node points only to the next node.

Singly Linked List

Doubly Linked List

A type of linked list where each node has a reference to both the next node and the previous node.

A type of linked list where each node has a reference to both the next node and the previous node.

Doubly Linked List

Circular Linked List

A type of linked list where the last node points to the first node.

A type of linked list where the last node points to the first node.

Circular Linked List

Binary Tree

A tree data structure in which each node has at most two children.

A tree data structure in which each node has at most two children.

Binary Tree

AVL Tree

A self-balancing binary search tree.

A self-balancing binary search tree.

AVL Tree

Graph

A data structure that consists of a set of nodes and a set of edges that relate the nodes to each other.

A data structure that consists of a set of nodes and a set of edges that relate the nodes to each other.

Graph

Set

A collection of distinct elements in no particular order.

A collection of distinct elements in no particular order.

Set

Algorithm Efficiency

Refers to the computational complexity of an algorithm, in terms of time and space.

Refers to the computational complexity of an algorithm, in terms of time and space.

Algorithm Efficiency

Abstract Data Types (ADTs)

A high-level type that hides detail about its implementation.

A high-level type that hides detail about its implementation.

Abstract Data Types (ADTs)

Recursion

A process in which a function calls itself as a subroutine.

A process in which a function calls itself as a subroutine.

Recursion

Heap

A special case of a binary tree where the key of each node is either greater than or equal to its child nodes.

A special case of a binary tree where the key of each node is either greater than or equal to its child nodes.

Heap

Space Complexity

The amount of memory space that an algorithm takes to run to completion.

The amount of memory space that an algorithm takes to run to completion.

Space Complexity

Time Complexity

The computational complexity that describes the amount of time taken by an algorithm to run.

The computational complexity that describes the amount of time taken by an algorithm to run.

Time Complexity

Multidimensional Array

An array containing one or more arrays.

An array containing one or more arrays.

Multidimensional Array

Related Flashcards

Continue your spaced-repetition or comprehensible input learning with these other flashcard decks related to Programming.

Programming Concepts

Understand basic programming concepts applicable to any language.

Rust Syntax

Learn the syntax and structure of the Rust programming language.

Rust Async

Master asynchronous programming in Rust.