Data Structures - The Algorithms

The Algorithms

Data Structures

AVL Tree

+1

Fenwick Tree

Lowest Common Ancestor

Merge Two Binary Trees

Binary Tree Traversals

Maximum Fenwick Tree

Non Recursive Segment Tree

Segment Tree Other

Red Black Tree

Binary Search Tree Recursive

Treap

Basic Binary Tree

Binary Search Tree

+1

Segment Tree

Number of Possible Binary Trees

Lazy Segment Tree

Wavelet Tree

Binary Tree Mirror

Stack

+1

Next Greater Element

Stack with Singly Linked List

+2

Evaluate Postfix Notations

Infix to Prefix Conversion

Stock Span Problem

Infix to Postfix Conversion

Dijkstras Two Stack Algorithm

Prefix Evaluation

Postfix Evaluation

Balanced Parentheses

Stack with Doubly Linked List

Priority Queue Using List

Circular Queue

Double Ended Queue

Queue on List

Queue on Pseudo Stack

Circular Queue Linked List

Linked Queue

Skew Heap

Randomized Heap

Max Heap

Min Heap

Heap

Heap Generic

Binomial Heap

Middle Element of Linked List

Swap Nodes

Singly Linked List

+1

Doubly Linked List

+2

Deque Doubly

Doubly Linked List Two

Merge Two Lists

Circular Linked List

From Sequence

Skip List

Has Loop

Print Reverse

Trie

Alternate Disjoint Set

Disjoint Set

Double Hash

Hash Table with Linked List

Hash Table

Quadratic Probing

Min Priority Queue

Queue

Queue Using 2 Stacks

Vector 2

Cycle Detection

Add Two Numbers

Singly Circular Linked List

Local Maximom Point

Number Of Local Maximum Points

Stack ES 6

Graph

Graph 3

Graph 2

Trie Using Hashmap

Dsu Path Compression

Stack Using Array

Tree

Queue Using Linked List

Rb Tree

Queue Using Two Stacks

Linked List

Queue Using Array

Trie Modern

Binary Search Tree 2

Bloom Filter

List Array

Circular Queue Using Linked List

Stack Using Queue

Tree 234

Morrisinorder

Cll

Main Cll

Trie Tree

Reverse a Linked List

Queue Using Array 2

Linkedlist Implentation Usingarray

Dsu Union Rank

Binaryheap

Merge Sorted Array List

Search Singly Linked List Recursion

Cursor Linked List

Circle Linked List

Merge K Sorted Linkedlist

Merge Sorted Singly Linked List

Count Singly Linked List Recursion

Random Node

Create And Detect Loop

Stack Array List

Maximum Minimum Window

Decimal To Any Using Stack

Reverse Stack

Next Smaller Element

Postfix To Infix

Next Grater Element

Node Stack

Stack Array

Calculate Max Of Min

Largest Rectangle

Balanced Brackets

Infix To Postfix

Duplicate Brackets

Matrix Graphs

Cycles

Graphs

Connected Component

DIJSKSTRAS ALGORITHM

Bipartite Grapf DFS

Kahns Algorithm

Circular Buffer

Bag

Create BST From Sorted Array

Binary Tree

Tree Random Node

Print Top Viewof Tree

LCA

BST Iterative

Ceil In Binary Search Tree

BST Recursive Generic

Check If Binary Tree Balanced

Level Order Traversal

Red Black BST

Create Binary Tree From Inorder Preorder

Nearest Right Key

KD Tree

AVL Simple

Vertical Order Traversal

BST Recursive

Level Order Traversal Queue

Trie Imp

Tree Traversal

Valid BST Or Not

Generic Tree

Disjoint Sets

Heap Element

Fibonacci Heap

Empty Heap Exception

Generic Heap

Generic Array List Queue

Priority Queues

Deques

Queues

Main Cuckoo Hashing

Hash Map

Main

Generic Hash Map Using Array

Hash Map Linear Probing

Main Linear Probing

Generic Hash Map Using Array List

Hash Map Cuckoo Hashing

MRU Cache

Dynamic Array

Ascending Priority Queue

Singly Link List Deletion

Merge Linked Lists

Middle Element in List

Queue Linked List

Bfs Queue

Hamiltonian

Transitive Closure

Bfs

Dfs

Euler

Dfs Recursive

List

Hash Set

Create Node

Words Alphabetical

Threaded Binary Trees

Recursive Traversals

Carray

Dict

Parenthesis

B Tree

Min Heap Two

Cycle in Linked List

Priority Queue

List Queue

Array Stack

Quad Tree

Hashing

Maximum Product Subarray

Jewels and Stones

Remove Vowels

Almost Palindrome Checker

Anagram Checker

Find the Highest Altitude

Remove Elements

Single Number

3sum

Get Products of All Other Elements

Max 69 Number

Shuffle Array

Sorted Arrays Intersection

Good Pairs

Find All Duplicates in an Array

Richest Customer Wealth

Shortest Word Distance

Sort Squares of an Array

Two Sum Ii

Isomorphic Strings

Common Characters

Uncommon Words

Arrays Intersection

Postorder Traversal

Preorder Traversal

Inorder Traversal

Invert

Basic Binary Search Tree

Splay

Median Heap

Table Stack

Table Heap

Linked Deque

Table List

© The Algorithms 2022

What is an algorithm?About us Programming Languages Contribute Donate

GitHub Gitter Twitter Source code Contact

Powered by Vercel