Java implementation of MaxHeap and MinHeap data structures with sorting functionalities. The program prompts the user to input the number of nodes and their values, constructs both max and min heaps, and performs sorting to obtain ascending and descending order sorted arrays, respectively.

A collection of powerful data structures are using java

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

Some important data-structure's details and their implementation.

Here you can find some of mine projects from the bachelor's course of Algorithms and Data Structures, having Luca Tesei as professor at the University of Camerino (UNICAM)

Implementation of Kruskal's MST

Construction Scheduler utilizing data structures like min heaps and red-black tress

WashU CSE 247 labs M3, M7, M9, and M11.

Java implementation of a job scheduler using Heap and Red Black Tree data structures.

GatorTaxi's Ride Management System (Advanced Data Structure Project)

This repository contains the implementation of Dijkstra algorithm using min binary heap and finding reachable nodes and shortest distance in a given network

Generic Heap Tree in Java. It can be used as Max Heap or Min Heap.

Montículo de mínimo y montículo de máximo, implementación estática en un vector