The Algorithms logoThe Algorithms
About

Data Structures

Double Ended Queue

Priority Queue Using List

Queue on Pseudo Stack

Hash Table with Linked List

Quadratic Probing

Number of Possible Binary Trees

Binary Tree Traversals

Binary Search Tree

Lowest Common Ancestor

Merge Two Binary Trees

Non Recursive Segment Tree

Binary Search Tree Recursive

Doubly Linked List Two

Middle Element of Linked List

Circular Linked List

Doubly Linked List

Alternate Disjoint Set

Stock Span Problem

Next Greater Element

Prefix Evaluation

Evaluate Postfix Notations

Infix to Prefix Conversion

Dijkstras Two Stack Algorithm

Postfix Evaluation

Infix to Postfix Conversion

Balanced Parentheses

Randomized Heap

QueueUsing2Stacks

MinPriorityQueue

SingleCircularLinkedList

Circular Queue Using Linked List

Stack Using Linked List

Morrisinorder

Queue Using Two Stacks

Queue Using Array

Queue Using Linked List

Trie Using Hashmap

Queue Using Array2

Stack Using Array

Linkedlist Implentation Usingarray

Binary Search Tree2

MergeSortedSinglyLinkedList

Merge K SortedLinkedlist

CursorLinkedList

MergeSortedArrayList

CircleLinkedList

CountSinglyLinkedListRecursion

SearchSinglyLinkedListRecursion

PrintTopViewofTree

LevelOrderTraversal

LevelOrderTraversalQueue

ConnectedComponent

DecimalToAnyUsingStack

StackOfLinkedList

BalancedBrackets

GenericArrayListQueue

EmptyHeapException

HashMapLinearProbing

Transitive Closure

Threaded Binary Trees

Recursive Traversals

Middle Element in List

Stack Using Linked Lists

Singly Link List Deletion

Ascending Priority Queue

Cycle in Linked List

Linked List Stack

Postorder Traversal

Arrays Intersection

Richest Customer Wealth

Find All Duplicates in an Array

Sort Squares of an Array

Get Products of All Other Elements

Find the Highest Altitude

Sorted Arrays Intersection

Remove Elements

Almost Palindrome Checker

Basic Binary Search Tree