COP 5536 - Advanced data structures - Fall 2019 - Programming assignment

using maxheap and minheap to build an priority queue to process stock trading in high volumes

Implementation of the Huffman codification with java, using a minHeap and a binary tree, for the Data Structures course (URV, 2021)

COP5536 Final Project: A min heap and RBT implementation to track building records for execution

Java and C++ implementations of Min heap with and without arrays

This activity creates two completes binaries trees, uses the heap sort algotirhm to display hipothetical college studet's data

The Tree Algorithms project is a Java-based repository that provides implementations of various tree data structures and algorithms. It offers a collection of classes for building, manipulating, and traversing trees, as well as performing operations specific to different types of trees.

This application provides statistical data on courses offered over the last five academic years, specifically from the 2019 Fall term to the 2024 Spring term. It processes data from Excel files and stores it in efficient data structures for quick querying and analysis.

Static implementation of a minHeap using Java

Learning heap data structure

Heap sort using Min Heap concept in Java

Code for Rising Cities, an application with scratch implementations of Red Black Tree and Min Heap

Implementing the Huffman encoding and decoding algorithms

given a .txt file, it uses the huffman algorithm to encode the characters that compose the file into a sting of 0s and 1s based on character frequency. frequent characters use less space while rare characters use more.

Job Scheduling using red-black tree and priority queues in java

Hackerrank Exercise Jesse and Cookies with a MinHeap (Priority Queue)

Job Scheduler