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

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.

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

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

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.

Learning heap data structure

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

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

Implementing the Huffman encoding and decoding algorithms

Heap sort using Min Heap concept in Java

Static implementation of a minHeap using Java

Job Scheduler

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

Implementation of Linked-min heap, regular min-heap, linear priority queue and min heap-priority queue

This program reads information about jobs from two .txt files and assign jobs to the resources with using node based minheap structure.