The Algorithms logo
The Algorithms
AboutDonate

Data Structures

Stack with Singly Linked List

Stack with Doubly Linked List

Infix to Postfix Conversion

Next Greater Element

Evaluate Postfix Notations

Dijkstras Two Stack Algorithm

Infix to Prefix Conversion

Postfix Evaluation

Stock Span Problem

Prefix Evaluation

Balanced Parentheses

Binary Tree Traversals

Non Recursive Segment Tree

Merge Two Binary Trees

Binary Search Tree Recursive

Lowest Common Ancestor

Number of Possible Binary Trees

Doubly Linked List Two

Middle Element of Linked List

Circular Linked List

Doubly Linked List

Queue on Pseudo Stack

Double Ended Queue

Circular Queue Linked List

Priority Queue Using List

Randomized Heap

Quadratic Probing

Hash Table with Linked List

Alternate Disjoint Set

Queue Using 2 Stacks

Min Priority Queue

Single Circular Linked List

Number Of Local Maximum Points

Local Maximom Point

Trie Using Hashmap

Linkedlist Implentation Usingarray

Binary Search Tree 2

Queue Using Linked List

Stack Using Array

Queue Using Array

Circular Queue Using Linked List

Queue Using Array 2

Morrisinorder

Dsu Union Rank

Stack Using Linked List

Stack Using Queue

Dsu Path Compression

Reverse a Linked List

Queue Using Two Stacks

Hash Map Linear Probing

DIJSKSTRAS ALGORITHM

Connected Component

Bipartite Grapf DFS

Stack Array List

Decimal To Any Using Stack

Infix To Postfix

Balanced Brackets

Stack Of Linked List

Duplicate Brackets

Maximum Minimum Window

Vertical Order Traversal

Level Order Traversal

BST Recursive Generic

Ceil In Binary Search Tree

Create Binary Tree From Inorder Preorder

Check If Binary Tree Balanced

Valid BST Or Not

Create BST From Sorted Array

Nearest Right Key

Print Top Viewof Tree

Level Order Traversal Queue

Dynamic Array

Empty Heap Exception

Merge Sorted Singly Linked List

Create And Detect Loop

Merge K Sorted Linkedlist

Search Singly Linked List Recursion

Cursor Linked List

Circle Linked List

Merge Sorted Array List

Count Singly Linked List Recursion

Remove Duplicate Nodes

Generic Array List Queue

Disjoint Sets

Transitive Closure

Stack Using Linked Lists

Singly Link List Deletion

Middle Element in List

Ascending Priority Queue

Threaded Binary Trees

Recursive Traversals

Stack Using Singly Linked List

Linked List Stack

Cycle in Linked List

Sorted Arrays Intersection

Maximum Product Subarray

Sort Squares of an Array

Almost Palindrome Checker

Remove Elements

Richest Customer Wealth

Find All Duplicates in an Array

Get Products of All Other Elements

Find the Highest Altitude

Postorder Traversal

Arrays Intersection

Basic Binary Search Tree