The Algorithms logo
The Algorithms
AboutDonate

Data Structures

Priority Queue Using List

Double Ended Queue

Queue on Pseudo Stack

Randomized Heap

Doubly Linked List Two

Doubly Linked List

Circular Linked List

Middle Element of Linked List

Balanced Parentheses

Next Greater Element

Infix to Postfix Conversion

Prefix Evaluation

Evaluate Postfix Notations

Infix to Prefix Conversion

Stock Span Problem

Postfix Evaluation

Dijkstras Two Stack Algorithm

Merge Two Binary Trees

Lowest Common Ancestor

Non Recursive Segment Tree

Binary Search Tree

Binary Tree Traversals

Binary Search Tree Recursive

Number of Possible Binary Trees

Quadratic Probing

Hash Table with Linked List

Alternate Disjoint Set

MinPriorityQueue

SingleCircularLinkedList

QueueUsing2Stacks

Circular Queue Using Linked List

Morrisinorder

Queue Using Linked List

Stack Using Array

Queue Using Array

Trie Using Hashmap

Linkedlist Implentation Usingarray

Queue Using Two Stacks

Queue Using Array2

Stack Using Linked List

Binary Search Tree2

StackOfLinkedList

DecimalToAnyUsingStack

BalancedBrackets

EmptyHeapException

LevelOrderTraversal

PrintTopViewofTree

LevelOrderTraversalQueue

GenericArrayListQueue

CountSinglyLinkedListRecursion

SearchSinglyLinkedListRecursion

Merge K SortedLinkedlist

MergeSortedSinglyLinkedList

CursorLinkedList

MergeSortedArrayList

CircleLinkedList

HashMapLinearProbing

ConnectedComponent

Threaded Binary Trees

Recursive Traversals

Singly Link List Deletion

Stack Using Linked Lists

Ascending Priority Queue

Middle Element in List

Transitive Closure

Cycle in Linked List

Linked List Stack

Almost Palindrome Checker

Richest Customer Wealth

Find All Duplicates in an Array

Get Products of All Other Elements

Maximum Product Subarray

Sorted Arrays Intersection

Sort Squares of an Array

Remove Elements

Find the Highest Altitude

Postorder Traversal

Arrays Intersection

Basic Binary Search Tree