The Algorithms logo
The Algorithms
AboutDonate

Data Structures

Binary Search Tree

Binary Search Tree Recursive

Binary Tree Node Sum

Binary Tree Path Sum

Binary Tree Traversals

Diff Views of Binary Tree

Inorder Tree Traversal 2022

Lowest Common Ancestor

Maximum Fenwick Tree

Merge Two Binary Trees

Non Recursive Segment Tree

Number of Possible Binary Trees

Alternate Disjoint Set

Hash Table with Linked List

Quadratic Probing

Randomized Heap

Circular Linked List

Doubly Linked List

Doubly Linked List Two

Middle Element of Linked List

Rotate to the Right

Singly Linked List

Circular Queue Linked List

Double Ended Queue

Priority Queue Using List

Queue by Two Stacks

Queue on Pseudo Stack

Balanced Parentheses

Dijkstras Two Stack Algorithm

Infix to Postfix Conversion

Infix to Prefix Conversion

Next Greater Element

Postfix Evaluation

Prefix Evaluation

Stack with Doubly Linked List

Stack with Singly Linked List

Stock Span Problem

Local Maximom Point

Number Of Local Maximum Points

Key Priority Queue

Min Priority Queue

Reverse Singly Linked List

Singly Circular Linked List

Queue Using 2 Stacks

Binary Search Tree 2

Circular Queue Using Linked List

Dsu Path Compression

Dsu Union Rank

Linked List

Linkedlist Implentation Usingarray

Morrisinorder

Queue Using Array

Queue Using Array 2

Queue Using Linked List

Queue Using Two Stacks

Reverse a Linked List

Stack Using Array

Stack Using Queue

Trie Using Hashmap

Disjoint Set Union

Dynamic Array

Bipartite Grapf DFS

Connected Component

DIJSKSTRAS ALGORITHM

Tarjans Algorithm

Generic Hash Map Using Array

Generic Hash Map Using Array List

Hash Map Cuckoo Hashing

Linear Probing Hash Map

Empty Heap Exception

Circle Linked List

Count Singly Linked List Recursion

Create And Detect Loop

Cursor Linked List

Merge Sorted Array List

Merge Sorted Singly Linked List

Merge K Sorted Linkedlist

Quick Sort Linked List

Rotate Singly Linked Lists

Search Singly Linked List Recursion

Generic Array List Queue

Stack Array List

BST From Sorted Array

BST Recursive Generic

Ceil In Binary Search Tree

Check Binary Tree Is Valid BST

Check If Binary Tree Balanced

Check Tree Is Symmetric

Create Binary Tree From Inorder Preorder

Inorder Traversal

Level Order Traversal

Post Order Traversal

Pre Order Traversal

Print Top Viewof Tree

Same Trees Check

Tree Random Node

Vertical Order Traversal

Zigzag Traversal

Nearest Right Key

Recursive Traversals

Threaded Binary Trees

Transitive Closure

Ascending Priority Queue

Circular Doubly Linked List

Middle Element in List

Singly Link List Deletion

Segment Tree Recursive

Cycle in Linked List

Find All Duplicates in an Array

Find the Highest Altitude

Get Products of All Other Elements

Maximum Product Subarray

Remove Elements

Richest Customer Wealth

Shortest Word Distance

Sort Squares of an Array

Sorted Arrays Intersection

Almost Palindrome Checker

Disjoint Sets

Unweighted Graph

Arrays Intersection

Data Structure

Basic Binary Search Tree

Prefix Aggregate List

Undirected Graph