Native JavaScript Data Structures
JavaScript provides a handful of native data structures that you can start using in your code right now.
The JavaScript data structures collection includes implementations and examples of some of the most commonly-used data structures. Data structure snippets are best used as a learning resource, as they might require optimizations to run in production.
JavaScript provides a handful of native data structures that you can start using in your code right now.
A queue is a linear data structure which follows a first in, first out (FIFO) order of operations.
A stack is a linear data structure which follows a last in, first out (LIFO) order of operations.
A linked list is a linear data structure where each element points to the next.
A doubly linked list is a linear data structure where each element points both to the next and the previous one.
A graph is a data structure consisting of a set of vertices connected by a set of edges.
A tree is a data structure consisting of a set of linked nodes representing a hierarchical tree structure.
A binary tree is a hierarchical data structure of linked nodes with at most two children each.
A binary search tree is a hierarchical data structure of ordered nodes with at most two children each.
A deep dive into modeling money, currencies, and exchange rates using JavaScript.
Learn everything you need to know about Big-O notation with this handy cheatsheet.