The Algorithms logo
The Algorithms
AboutDonate

Data Structures

Hash Table with Linked List

Quadratic Probing

Singly Linked List

Middle Element of Linked List

Circular Linked List

Doubly Linked List

Doubly Linked List Two

Alternate Disjoint Set

Randomized Heap

Binary Search Tree

Lowest Common Ancestor

Non Recursive Segment Tree

Merge Two Binary Trees

Binary Tree Traversals

Binary Search Tree Recursive

Number of Possible Binary Trees

Priority Queue Using List

Double Ended Queue

Circular Queue Linked List

Queue on Pseudo Stack

Postfix Evaluation

Stock Span Problem

Infix to Postfix Conversion

Evaluate Postfix Notations

Next Greater Element

Stack with Singly Linked List

Dijkstras Two Stack Algorithm

Infix to Prefix Conversion

Prefix Evaluation

Stack with Doubly Linked List

Balanced Parentheses

Queue Using 2 Stacks

Local Maximom Point

Number Of Local Maximum Points

Singly Circular Linked List

Min Priority Queue

Queue Using Linkedlist

Circular Queue Using Linked List

Binary Search Tree 2

Dsu Path Compression

Queue Using Array

Stack Using Array

Linkedlist Implentation Usingarray

Reverse a Linked List

Stack Using Queue

Dsu Union Rank

Queue Using Two Stacks

Queue Using Array 2

Trie Using Hashmap

Morrisinorder

Generic Array List Queue

Dynamic Array

Circle Linked List

Merge Sorted Singly Linked List

Cursor Linked List

Search Singly Linked List Recursion

Count Singly Linked List Recursion

Merge K Sorted Linkedlist

Create And Detect Loop

Merge Sorted Array List

Disjoint Sets

Hash Map Linear Probing

Bipartite Grapf DFS

Connected Component

DIJSKSTRAS ALGORITHM

Empty Heap Exception

Level Order Traversal

Valid BST Or Not

Check If Binary Tree Balanced

Create Binary Tree From Inorder Preorder

Tree Random Node

Create BST From Sorted Array

Print Top Viewof Tree

Vertical Order Traversal

BST Recursive Generic

Level Order Traversal Queue

Ceil In Binary Search Tree

Nearest Right Key

Next Smaller Element

Balanced Brackets

Maximum Minimum Window

Duplicate Brackets

Decimal To Any Using Stack

Largest Rectangle

Postfix To Infix

Stack Array List

Next Grater Element

Calculate Max Of Min

Infix To Postfix

Recursive Traversals

Threaded Binary Trees

Middle Element in List

Ascending Priority Queue

Singly Link List Deletion

Transitive Closure

Cycle in Linked List

Postorder Traversal

Sorted Arrays Intersection

Maximum Product Subarray

Find the Highest Altitude

Get Products of All Other Elements

Find All Duplicates in an Array

Shortest Word Distance

Sort Squares of an Array

Richest Customer Wealth

Almost Palindrome Checker

Remove Elements

Arrays Intersection

Basic Binary Search Tree