Browse Code Data structures and algorithms Data structure implementations Hash table implementation using array and linked list Priority queue implementation using heap – recursive solution Priority queue implementation using heap – iterative solution Circular queue implementation using array – Queue 2 Priority queue implementation – unordered array Priority queue implementation – ordered array Circular linked list implementation – Linked list part 3 Linked list implementation – Linked list part 1 Doubly linked list implementation – Linked list part 2 1 2 › Trees and variations Max-heap implementation – bubble up/down algorithm Binary search tree with parent pointer – Binary tree 3 Trie implementation using array – Trie part 1 Trie implementation using hashmap – Trie part 3 Binary search tree implementation – Binary tree 2 Binary tree implementation – Binary tree 1 Min-heap implementation – Heap part 2 Trie implementation using linked list – Trie part 2 Graph theory Graph as adjacency matrix – Graph implementation 3 Graph implementation as adjacency list – unweighted Graph Weighted graph as adjacency list – Graph implementation 2 Fundamental algorithms Heapsort (2 solutions) – iteration and recursion Quicksort – divide and conquer Bubble sort (2 solutions) – Java/Python/JavaScript Merge sort – divide and conquer Insertion sort Selection sort Binary search Math Fibonacci number – find nth fibonacci 4 solutions Catalan number – find nth Catalan number 3 solutions Factorial number Prime number
