The pairing heap is an implementation of the priority queue, the heap is represented in binary form.

Binary Search Tree (BST) Traversal

Implementation of MST Algorithms - 1. Prim's Algorithm (with 3 versions - PriorityQueue<Edge>, PriorityQueue<Vertex>, and IndexedBinaryHeap<Vertices>) and 2. Kruskal's Algorithm on Connected Graphs.

mercator scheme/rate-limiting/scheduling part of whirlpool project; handles crawler priority and politeness

Implementation of Prim's Algorithm using Heap data structure (coded in arrays from scratch) that can compute the overall spanning weight.

This repository contains all the data structures and their application in Java.

This repository contains implementations of several data structures like stacks, queues, binary heaps, priority queues, trees, BSTs, Hashtable, and algorithms like BFS, DFS, merge sort, modified merge sort (for 2D matrices), Pattern-matching and more.

This repository contains all the exercises developed for Data Structures' course [GIISOF01-2-003] at EII (UniOvi) during 2018-2019's course.

Huffman Coding lossless compression and decompression for large text files

Implementation of Huffman Encoder and Decoder using binary heap, pairing heap and four way optimized heap.

Various heap implementations in Java

Implementación del algoritmo de Huffman con un Heap binario

An implementation of huffman tree encoding and decoding schema using different data structures

Data Structures and Algorithms

[fa18] Analysis of data structures and their associated algorithms. Abstract data types, lists, stacks, queues, trees, and graphs. Sorting, searching, hashing.

Java implementation of the priority queue data structure : MaxHeap, MinHeap and MedianHeap

Advanced Data Structures

Binary heap implementation

Different data structures implementaions and applications.