Repository files navigation

A comprehensive JavaScript library implementing fundamental data structures and algorithms, designed to provide efficient and reusable solutions for developers.

• 📊 Arrays
• 🌳 Trees
  • Binary Tree
  • Binary Search Tree
  • AVL Tree
  • Red-Black Tree
• 📦 Stacks
• 📮 Queues
  • Standard Queue
  • Priority Queue
  • Circular Queue
• 🔗 Linked Lists
  • Singly Linked List
  • Doubly Linked List
  • Circular Linked List
• 🕸️ Graphs
  • Adjacency List
  • Adjacency Matrix
• 🗺️ Hash Tables
• 🌲 Heaps
  • Min Heap
  • Max Heap

• 🔍 Searching
  • Linear Search
  • Binary Search
• 🔢 Sorting
  • Bubble Sort
  • Quick Sort
  • Merge Sort
  • Insertion Sort
• 🗺️ Graph Algorithms
  • Dijkstra's Shortest Path
  • Breadth-First Search
  • Depth-First Search
• 🌳 Tree Traversals
  • In-order
  • Pre-order
  • Post-order

# Clone the repositorygit clone https://github.com/AjmalDevala/DataStructure_js.git# Navigate to project directorycd DataStructure-js# Install dependenciesnpm install

// Create a Binary Search Treeconstbst=newBinarySearchTree();bst.insert(10);bst.insert(5);bst.insert(15);// Perform operationsconsole.log(bst.search(5));// Returns the nodebst.delete(10);

1. Fork the repository
2. Create your feature branch (git checkout -b feature/AmazingFeature)
3. Commit your changes (git commit -m 'Add some AmazingFeature')
4. Push to the branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

Distributed under the MIT License. SeeLICENSE for more information.