The Algorithms logo
The Algorithms

Data Structures

Inorder Tree Traversal 2022

Maximum Fenwick Tree

Binary Search Tree

Merge Two Binary Trees

Diff Views of Binary Tree

Binary Tree Path Sum

Lowest Common Ancestor

Binary Tree Traversals

Binary Tree Node Sum

Number of Possible Binary Trees

Non Recursive Segment Tree

Binary Search Tree Recursive

Priority Queue Using List

Double Ended Queue

Queue on Pseudo Stack

Circular Queue Linked List

Circular Linked List

Doubly Linked List

Doubly Linked List Two

Singly Linked List

Middle Element of Linked List

Alternate Disjoint Set

Randomized Heap

Hash Table with Linked List

Quadratic Probing

Balanced Parentheses

Next Greater Element

Stack with Doubly Linked List

Evaluate Postfix Notations

Stock Span Problem

Infix to Postfix Conversion

Prefix Evaluation

Postfix Evaluation

Stack with Singly Linked List

Infix to Prefix Conversion

Dijkstras Two Stack Algorithm

Min Priority Queue

Queue Using 2 Stacks

Local Maximom Point

Number Of Local Maximum Points

Reverse Singly Linked List

Singly Circular Linked List

Dsu Path Compression

Queue Using Linkedlist

Stack Using Queue

Queue Using Two Stacks

Binary Search Tree 2

Linkedlist Implentation Usingarray

Circular Queue Using Linked List

Reverse a Linked List

Dsu Union Rank

Trie Using Hashmap

Stack Using Array

Queue Using Array 2

Queue Using Array


Generic Hash Map Using Array

Hash Map Cuckoo Hashing

Generic Hash Map Using Array List

Hash Map Linear Probing

Count Singly Linked List Recursion

Search Singly Linked List Recursion

Merge K Sorted Linkedlist

Merge Sorted Singly Linked List

Circle Linked List

Cursor Linked List

Merge Sorted Array List

Create And Detect Loop

Disjoint Sets

Dynamic Array

Empty Heap Exception


Bipartite Grapf DFS

Connected Component

Ceil In Binary Search Tree

Level Order Traversal

Nearest Right Key

Print Top Viewof Tree

Tree Random Node

Level Order Traversal Queue

Create Binary Tree From Inorder Preorder

Vertical Order Traversal

Check If Binary Tree Balanced

BST Recursive Generic

Check Tree Is Symmetric

Valid BST Or Not

Create BST From Sorted Array

Generic Array List Queue

Next Grater Element

Maximum Minimum Window

Infix To Postfix

Stack Array List

Postfix To Infix

Decimal To Any Using Stack

Calculate Max Of Min

Balanced Brackets

Largest Rectangle

Next Smaller Element

Duplicate Brackets

Threaded Binary Trees

Recursive Traversals

Singly Link List Deletion

Ascending Priority Queue

Middle Element in List

Transitive Closure

Cycle in Linked List

Postorder Traversal

Find All Duplicates in an Array

Sorted Arrays Intersection

Sort Squares of an Array

Find the Highest Altitude

Maximum Product Subarray

Remove Elements

Shortest Word Distance

Richest Customer Wealth

Get Products of All Other Elements

Almost Palindrome Checker

Arrays Intersection

Basic Binary Search Tree