The Algorithms logo
The Algorithms
AboutDonate

Data Structures

Alternate Disjoint Set

Stack with Singly Linked List

Infix to Prefix Conversion

Infix to Postfix Conversion

Stack with Doubly Linked List

Dijkstras Two Stack Algorithm

Evaluate Postfix Notations

Balanced Parentheses

Next Greater Element

Postfix Evaluation

Stock Span Problem

Prefix Evaluation

Hash Table with Linked List

Quadratic Probing

Circular Queue Linked List

Double Ended Queue

Queue on Pseudo Stack

Priority Queue Using List

Randomized Heap

Doubly Linked List

Singly Linked List

Doubly Linked List Two

Middle Element of Linked List

Circular Linked List

Binary Tree Node Sum

Binary Tree Traversals

Diff Views of Binary Tree

Binary Search Tree

Binary Tree Path Sum

Inorder Tree Traversal 2022

Lowest Common Ancestor

Merge Two Binary Trees

Maximum Fenwick Tree

Binary Search Tree Recursive

Non Recursive Segment Tree

Number of Possible Binary Trees

Singly Circular Linked List

Reverse Singly Linked List

Min Priority Queue

Local Maximom Point

Number Of Local Maximum Points

Queue Using 2 Stacks

Morrisinorder

Linkedlist Implentation Usingarray

Queue Using Linked List

Trie Using Hashmap

Dsu Union Rank

Stack Using Array

Queue Using Two Stacks

Reverse a Linked List

Dsu Path Compression

Stack Using Queue

Queue Using Array 2

Queue Using Array

Circular Queue Using Linked List

Binary Search Tree 2

Disjoint Sets

Largest Rectangle

Next Smaller Element

Next Grater Element

Decimal To Any Using Stack

Maximum Minimum Window

Calculate Max Of Min

Infix To Postfix

Balanced Brackets

Duplicate Brackets

Postfix To Infix

Stack Array List

Generic Hash Map Using Array

Hash Map Linear Probing

Hash Map Cuckoo Hashing

Generic Hash Map Using Array List

Check Tree Is Symmetric

Level Order Traversal

Nearest Right Key

Valid BST Or Not

Tree Random Node

Ceil In Binary Search Tree

Level Order Traversal Queue

Vertical Order Traversal

Create Binary Tree From Inorder Preorder

Check If Binary Tree Balanced

Create BST From Sorted Array

Print Top Viewof Tree

BST Recursive Generic

Dynamic Array

Connected Component

Bipartite Grapf DFS

DIJSKSTRAS ALGORITHM

Merge Sorted Singly Linked List

Cursor Linked List

Merge Sorted Array List

Count Singly Linked List Recursion

Merge K Sorted Linkedlist

Create And Detect Loop

Search Singly Linked List Recursion

Circle Linked List

Generic Array List Queue

Empty Heap Exception

Transitive Closure

Recursive Traversals

Threaded Binary Trees

Ascending Priority Queue

Singly Link List Deletion

Middle Element in List

Cycle in Linked List

Postorder Traversal

Shortest Word Distance

Get Products of All Other Elements

Richest Customer Wealth

Maximum Product Subarray

Find All Duplicates in an Array

Find the Highest Altitude

Sort Squares of an Array

Almost Palindrome Checker

Sorted Arrays Intersection

Remove Elements

Arrays Intersection

Basic Binary Search Tree