Data Structures - The Algorithms

TheAlgorithms

About Gitter GitHub Twitter

Data Structures

Avl Tree

Basic Binary Tree

Binary Search Tree

+1

Binary Search Tree Recursive

Binary Tree Mirror

Binary Tree Traversals

Fenwick Tree

Lazy Segment Tree

Lowest Common Ancestor

Non Recursive Segment Tree

Number Of Possible Binary Trees

Red Black Tree

Segment Tree

Segment Tree Other

Treap

Alternate Disjoint Set

Disjoint Set

Double Hash

Hash Table

Hash Table With Linked List

Prime Numbers

Quadratic Probing

Binomial Heap

Heap

Heap Generic

Max Heap

Min Heap

Randomized Heap

Skew Heap

Circular Linked List

Deque Doubly

Doubly Linked List

+2

Doubly Linked List Two

From Sequence

Has Loop

Is Palindrome

Merge Two Lists

Middle Element Of Linked List

Print Reverse

Singly Linked List

Skip List

Swap Nodes

Circular Queue

Double Ended Queue

Linked Queue

Priority Queue Using List

Queue On List

Queue On Pseudo Stack

Balanced Parentheses

Dijkstras Two Stack Algorithm

Evaluate Postfix Notations

Infix To Postfix Conversion

Infix To Prefix Conversion

Linked Stack

Next Greater Element

Postfix Evaluation

Prefix Evaluation

Stack

Stack Using Dll

Stock Span Problem

Trie

Graph

Graph2

MinPriorityQueue

CycleDetection

RotateListRight

SingleCircularLinkedList

SinglyLinkList

Queue

QueueUsing2Stacks

StackES6

Binary Search Tree2

Binaryheap

Circular Queue Using Linked List

Cll

Main Cll

Linked List

Linkedlist Implentation Usingarray

List Array

Morrisinorder

Queue Using Array

Queue Using Array2

Queue Using Linked List

Queue Using Two Stacks

Stack Using Array

Stack Using Linked List

Test Queue

Test Stack

Test Stack Students

Tree

Tree 234

Trie Modern

Trie Tree

Bag

CircularBuffer

DynamicArray

ConnectedComponent

Cycles

Graphs

MatrixGraphs

HashMap

HashMapLinearProbing

Main

MainLinearProbing

EmptyHeapException

HeapElement

CircleLinkedList

CountSinglyLinkedListRecursion

CursorLinkedList

Merge K SortedLinkedlist

MergeSortedArrayList

MergeSortedSinglyLinkedList

SearchSinglyLinkedListRecursion

GenericArrayListQueue

PriorityQueues

Queues

BalancedBrackets

DecimalToAnyUsingStack

InfixToPostfix

NodeStack

StackArray

StackArrayList

StackOfLinkedList

BinaryTree

BSTIterative

BSTRecursive

GenericTree

LevelOrderTraversal

LevelOrderTraversalQueue

PrintTopViewofTree

RedBlackBST

TreeTraversal

TrieImp

ValidBSTOrNot

Carray

Carray Tests

Create Node

Recursive Traversals

Threaded Binary Trees

Dict

Test Program

Bfs

Bfs Queue

Dfs

Dfs Recursive

Euler

Hamiltonian

Transitive Closure

Hash Set

Ascending Priority Queue

Merge Linked Lists

Middle Element In List

Queue Linked List

Singly Link List Deletion

Stack Using Linked Lists

List

Parenthesis

Btree

Node

Hashmap Test

Singlylinkedlist2

Singlylinkedlist Test

Trie Test

Binary Tree Traversal

Hashing

Min Heap Two

Cycle In Linked List

Quad Tree

List Queue

Priority Queue

Array Stack

Linked List Stack

Get Products Of All Other Elements

Inorder Traversal

Invert

Postorder Traversal

Preorder Traversal

© The Algorithms 2021

What is an algorithm?About us Programming Languages Contribute Source code

GitHub Gitter Twitter All algorithms