Data Structures and Algorithms in JavaScript

Click ★ if you like the project. Your contributions are heartily ♡ welcome.

Related Topics

• HTML Basics
• CSS Basics
• JavaScript ES6 Basics
• JavaScript Unit Testing
• JavaScript Design Patterns
• JavaScript Coding Practice

Table of Contents

• Introduction
• Big O Notation
• Arrays
• Stacks
  • Operations on Stacks
    • PUSH Operation
    • POP Operation
    • Display Operation
    • isEmpty Operation
  • Application of Stacks
    • Recursion
    • Reversal of String
    • Checking the Parenthesis Matching
    • Polish Notation of Arithmetic Expressions
    • Conversion of the Expressions
    • Evaluation of POSTFIX Expression
• Queues
  • Operations on a Queue
    • Insertion
    • Deletion
    • Qempty Operation
    • Qfull Operation
    • Display Operation
  • Types of Queues
    • Simple Queue
    • Circular Queue
    • Priority Queue
    • Double Ended Queue
• Linked Lists
  • Operations on Linked Lists
    • Creating a Linked Lists
    • Traversing a Linked Lists
    • Displaying a Linked Lists
    • Length Operation
    • Searching a Linked Lists
    • Insertion into a Linked Lists
    • Deletion Operations on a singly Linked Lists
    • Sorting a Linked Lists
    • Reversing a Linked Lists
    • Merging of two Sorted Lists
  • Types of Linked Lists
    • Singly Linked Lists
    • Circular Linked Lists
      • Creation of a CLL
      • Display operation on a CLL
      • Insertion into a CLL
      • Deletion of a node from CLL
      • Implementation of Stacks using CLL
      • Implementation of Queue using CLL
    • Doubly Linked Lists
      • Creating a DLL
      • Displaying a DLL
      • Inserting a node into DLL
      • Deleting a node from DLL
    • Header Linked Lists
      • Grounded Header Linked List
        • Creation
        • Insertion Operation
        • Delete Operation
      • Circular Header Linked List
        • Creating a Linked List
        • Insertion
      • Application of Linked Lists
        • Addition of two Polynomials
        • Addition of two long positive Integers
  • Linked List Implementation of Stacks
  • Linked List Implementation of Queue
  • Linked List Implementation of Priority Queue
• Trees
  • Binary Trees
    • Strictly Binary Tree
    • Complete Binary Tree
    • Almost Full Binary Tree
  • Binary Search Trees
    • Operations on a Binary Search Tree
      • Constructing Binary Search Tree Insertion
      • Searching Operation on a BST
      • Deletion operatin on BST
      • Traversals
      • Finding Maximum value in BST
      • Finding Minimum value in BST
  • Threaded Binary Tree
    • Right in Threaded Binary Trees
    • Left in Threaded Binary Trees
  • Creation of BST from preorder and inorder traversals
  • Creation of BST from postorder and inorder traversals
  • AVL Trees
  • B- Trees
  • B+ Trees
  • Red-Black Trees
• Graph
  • Breadth First Search Algorithm
  • Depth First Search Algorithm
  • Kruskal's Algorithm
  • Dijkstra Algorithm
  • Prim's Algorithm
  • Travelling Salesman Problem
  • Floyd-Warshall Algorithm
• Sorting
  • Address Calculation Sort
  • Binary Tree Sort
  • Bubble Sort
  • Bucket Sort
  • Heap Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Radix Sort
  • Selection Sort
  • Shell Sort
• Searching
  • Linear Search
  • Binary Search
  • Indexed Sequential Search
• Hash Table
• Heap
• Miscellaneous

↥ back to top