The Algorithms logo
The Algorithms
Acerca deDonar

Estructuras de datos

Hash Table with Linked List

Middle Element of Linked List

Binary Search Tree Recursive

Number of Possible Binary Trees

Non Recursive Segment Tree

Circular Queue Linked List

Priority Queue Using List

Queue on Pseudo Stack

Dijkstras Two Stack Algorithm

Balanced Parentheses

Evaluate Postfix Notations

Next Greater Element

Stack with Doubly Linked List

Stack with Singly Linked List

Infix to Postfix Conversion

Infix to Prefix Conversion

Min Priority Queue

Singly Circular Linked List

Local Maximom Point

Number Of Local Maximum Points

Queue Using 2 Stacks

Queue Using Array 2

Circular Queue Using Linked List

Dsu Path Compression

Stack Using Queue

Queue Using Array

Binary Search Tree 2

Queue Using Linked List

Stack Using Array

Linkedlist Implentation Usingarray

Queue Using Two Stacks

Reverse a Linked List

Trie Using Hashmap

Search Singly Linked List Recursion

Merge Sorted Singly Linked List

Count Singly Linked List Recursion

Merge Sorted Array List

Create And Detect Loop

Merge K Sorted Linkedlist

BST Recursive Generic

Level Order Traversal Queue

Check If Binary Tree Balanced

Create BST From Sorted Array

Print Top Viewof Tree

Level Order Traversal

Vertical Order Traversal

Ceil In Binary Search Tree

Create Binary Tree From Inorder Preorder

Decimal To Any Using Stack

Next Grater Element

Calculate Max Of Min

Next Smaller Element

Maximum Minimum Window

Generic Array List Queue

Singly Link List Deletion

Find All Duplicates in an Array

Richest Customer Wealth

Sort Squares of an Array

Find the Highest Altitude

Get Products of All Other Elements

Maximum Product Subarray

Almost Palindrome Checker

Shortest Word Distance

Sorted Arrays Intersection