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

Collection of my solutions to various leetcode problems

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

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

Design Cab system inspired from elevator #Elevator#DS#Heap

This repo is a project for cop5536 at University of Florida. The goal is to build a building management system for a city. It's implemented using C++ and main strategies are Min Heap and Red-Black Tree.

Data structure HW. Implement Dijkstra's algorithm by min heap data structure using C++ language

Static implementation of a minHeap using Java

Algorithm for sorting multiple sorted log-files into one sorted log-file base on time-stamp

minheap/maxheap for C

Trabalho 1 de Djikstra desenvolvido na disciplina TBO na UFES, em 2024/2

Modified Djikstra's algorithm with Minheap used to solve assigned task.

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.

Learning heap data structure

Implementation of Compression Huffman Algorithm in C++

Designed a scalable and efficient search engine in Python to query a Wikipedia corpus of ~75GB with a response time of 1s and outputs the top 10 relevant documents based on the search query.

CS300 Data Structures course assignments at Sabanci University (Fall 2021-2022).