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

Different data structures implementaions and applications.

Advanced Data Structures

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

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

Various heap implementations in Java

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

Binary Search Tree (BST) Traversal

Binary heap implementation

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.

Implementación del algoritmo de Huffman con un Heap binario

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

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

Data Structures and Algorithms

Huffman Coding lossless compression and decompression for large text files

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.

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.