Algorithms & Data Structures in JavaScript

Algorithms

Binary Search Tree

• Binary Search Tree
• Binary Search Tree Utilities

Graphs

Linked List

List+

Stacks and Queues

Tree

Tree+

3. ADT Unsorted List

• 3.1 UnSorted Class ADT (Array based implementation)
• 3.2 UnSorted Class ADT (Linked List Structure)

4. ADT Sorted List

• 4.1 Sorted List Class ADT (Array based implementation)
• 4.2 Sorted List Class ADT (Linked List Structure)

5. Stacks & Queues

• 5.1 Stack (Array based implementaion 1)

• 5.2 Stack (Array based implementaion 2)

• 5.3 Stack (Linked List Structure)

• 5.4 Queue

• 5.5 Another Queue Design

• Singly Linked List (DS C++)

• Doubly Linked List (DS C++, OOPS C++)

• Specialized Linked List (DS C++)

• Circular Linked List (DS C++, OOPS C++)

• Doubly Linked Circular List (DS C++, OOPS C++)

• Dequeue: Double-ended Queue (Python)

• Implementing a Stack with a Singly Linked List (Python)

• Implementing a Queue with a Singly Linked List (Python)

• Implementing a Queue with a Circularly Linked List (Python)

• Round-Robin Schedulers: Circular linked List (Python)