An abstract Priority Queue class that can be inherited from to work with an data type.

High-performance timer implementation based on 5-level time wheel. 高性能定时器(5级时间轮，最小堆)[从零实现]

Express based http service that is an in-memory key-value store that supports TTLs on the keys

It is a project which Compress and decompress the file. In this project we majorly use 1. Hash maps 2. Trees 3. Min Heap

Implementing the Huffman encoding and decoding algorithms

Repository of efficient solutions for Leetcode problems

Benchmark of different timer implementations(min-heap, red-black tree, timing wheel) 不同数据结构实现的定时器测试

it create and display BST ,MIN HEAP TREE ,MAX HEAP TREE

This is a crossword puzzle game we created for our data structures course project. It is created using data structures concepts. Mainly Hashmaps are used in this project.Backtracking and min heap are also used.

"Huffman Text Compressor in C++" Our project employs the Huffman algorithm and min-heap data structure to compress text files efficiently in C++. Reduce file sizes without compromising data. Explore the code on GitHub and join us in optimizing this compression tool!

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.

A simple tool, to visualize, Binary Tree and Heap data structures. Made with vanilla JS.

CLI BookContact searching and sorting using datastructures

Uma implementação de heap em C, viável tanto para minheap como maxheap. É alocada dinamicamente e chama a função realloc quando não há mais espaço, dobrando-o.

Collection of my solutions to various leetcode problems

Basic binary tree operations such as: getLeft(), getRight(), bottomUp(), topDown()

MinHeap, MaxHeap, minHeapSort and maxHeapSort implementation in JavaScript.

Heap data structure with zero dependencies

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