This repository contains JavaScript based examples of data structures and algorithms.
- Singly Linked List
- Doubly Linked List
- Queue
- Stack
- Hash Table
- Heap - max heap
- Priority Queue
- Graph
- Tree
- Trie
Big O notation is used to classify algorithms according to how their running time or space requirements grow as the input size grows. On the chart below you may find most common orders of growth of algorithms specified in Big O notation.