Freecode Academy

Data Structures

↴ Data Structures

Learn how a Stack Works

Create a Stack Class

Create a Queue Class

Create a Priority Queue Class

Create a Circular Queue

Create a Set Class

Remove from a Set

Size of the Set

Perform a Union on Two Sets

Perform an Intersection on Two Sets of Data

Perform a Difference on Two Sets of Data

Perform a Subset Check on Two Sets of Data

Create and Add to Sets in ES6

Remove items from a set in ES6

Use .has and .size on an ES6 Set

Use Spread and Notes for ES5 Set() Integration

Create a Map Data Structure

Create an ES6 JavaScript Map

Create a Hash Table

Work with Nodes in a Linked List

Create a Linked List Class

Remove Elements from a Linked List

Search within a Linked List

Remove Elements from a Linked List by Index

Add Elements at a Specific Index in a Linked List

Create a Doubly Linked List

Reverse a Doubly Linked List

Add a New Element to a Binary Search Tree

Find the Minimum and Maximum Value in a Binary Search Tree

Check if an Element is Present in a Binary Search Tree

Find the Minimum and Maximum Height of a Binary Search Tree

Use Depth First Search in a Binary Search Tree

Use Breadth First Search in a Binary Search Tree

Delete a Leaf Node in a Binary Search Tree

Delete a Node with One Child in a Binary Search Tree

Delete a Node with Two Children in a Binary Search Tree

Invert a Binary Tree

Create a Trie Search Tree

Insert an Element into a Max Heap

Remove an Element from a Max Heap

Implement Heap Sort with a Min Heap

Adjacency Matrix

Incidence Matrix

Breadth-First Search

Depth-First Search