Data Structures and Algorithms in JavaScript

This repository covers the implementation of the most important algorithms and data structures.

This goes alone with these posts series that explain each implementation in details.

Data Structures

We are covering the following data structures.

Linear Data Structures

Arrays: Built-in in most languages so not implemented here. Code | Details.
Linked Lists: each data node has a link to the next (and previous). Code | Details.
Queue: data flows in a "first-in, first-out" (FIFO) manner. Code | Details.
Stacks: data flows in a "last-in, first-out" (LIFO) manner. Code | Details.

Non-Linear Data Structures

Trees: data nodes has zero or more adjacent nodes a.k.a. children. Each node can only have one parent node otherwise is a graph not a tree. Code | Details
1. Binary Trees: same as tree but only can have two children at most. Details
2. Binary Search Trees (BST): same as binary tree, but the nodes value keep this order left < parent < rigth. Code | Details
3. AVL Trees: Self-balanced BST to maximize look up time. Code | Details
4. Red-Black Trees: Self-balanced BST more loose than AVL to maximize insertion speed. Code | Details
Maps: key-value store.
1. Hash Maps: implements map using a hash function. Code | Details
2. Tree Maps: implement map using a self-balanced BST. WIP
Graphs: data nodes that can have a connection or edge to zero or more adjacent nodes. Unlike trees, nodes can have multiple parents, loops. Code | Details

Algorithms

Searching algorithms (WIP)
Sorting algorithms (WIP)

Notes

Some notes while working on this project

Tests

Running one test without changing file

jest -t '#findNodeAndParent'

Running one test changing code

it.only('should return with an element and its parent', () => {
// ...
});

English Words

Getting some (200k+) English words are useful for testing and benchmarking.

cat /usr/share/dict/words > benchmarks/dict.txt

ESLint

Disabling ESLints

somthing(t) =>  1  // eslint-disable-line no-unused-vars
// eslint-disable-next-line no-use-before-define
const  thing  =  new Thing();

/*eslint-disable */
//suppress all warnings between comments
alert('foo');
/*eslint-enable */

/* eslint-disable no-alert, no-console */
alert('foo');
console.log('bar');
/* eslint-enable no-alert */

License

n00bdevel/dsa.js-data-structures-and-algorithms-in-javascript

About

Resources

License

Contributing

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages