The Algorithms logo
The Algorithms

Data Structures

Randomized Heap

Binary Search Tree Recursive

Lowest Common Ancestor

Merge Two Binary Trees

Binary Tree Traversals

Number of Possible Binary Trees

Binary Search Tree

Non Recursive Segment Tree

Evaluate Postfix Notations

Postfix Evaluation

Prefix Evaluation

Dijkstras Two Stack Algorithm

Infix to Prefix Conversion

Infix to Postfix Conversion

Stock Span Problem

Next Greater Element

Stack with Doubly Linked List

Stack with Singly Linked List

Balanced Parentheses

Hash Table with Linked List

Quadratic Probing

Priority Queue Using List

Circular Queue Linked List

Double Ended Queue

Queue on Pseudo Stack

Middle Element of Linked List

Doubly Linked List Two

Doubly Linked List

Circular Linked List

Singly Linked List

Alternate Disjoint Set

Queue Using 2 Stacks

Min Priority Queue

Local Maximom Point

Number Of Local Maximum Points

Singly Circular Linked List

Stack Using Array

Reverse a Linked List


Dsu Path Compression

Stack Using Queue

Queue Using Array 2

Queue Using Two Stacks

Queue Using Linkedlist

Dsu Union Rank

Trie Using Hashmap

Circular Queue Using Linked List

Binary Search Tree 2

Queue Using Array

Linkedlist Implentation Usingarray

Disjoint Sets

Empty Heap Exception

Decimal To Any Using Stack

Next Smaller Element

Calculate Max Of Min

Postfix To Infix

Next Grater Element

Maximum Minimum Window

Infix To Postfix

Stack Array List

Duplicate Brackets

Largest Rectangle

Balanced Brackets

Bipartite Grapf DFS


Connected Component

Hash Map Linear Probing

Generic Array List Queue

Create Binary Tree From Inorder Preorder

Print Top Viewof Tree

Create BST From Sorted Array

Valid BST Or Not

Level Order Traversal

Level Order Traversal Queue

Tree Random Node

BST Recursive Generic

Ceil In Binary Search Tree

Nearest Right Key

Check If Binary Tree Balanced

Vertical Order Traversal

Create And Detect Loop

Cursor Linked List

Count Singly Linked List Recursion

Merge Sorted Array List

Merge K Sorted Linkedlist

Search Singly Linked List Recursion

Merge Sorted Singly Linked List

Circle Linked List

Dynamic Array

Transitive Closure

Recursive Traversals

Threaded Binary Trees

Middle Element in List

Ascending Priority Queue

Singly Link List Deletion

Cycle in Linked List

Arrays Intersection

Find All Duplicates in an Array

Richest Customer Wealth

Remove Elements

Get Products of All Other Elements

Almost Palindrome Checker

Maximum Product Subarray

Sort Squares of an Array

Find the Highest Altitude

Sorted Arrays Intersection

Shortest Word Distance

Postorder Traversal

Basic Binary Search Tree