Binary heap module in python (Min Heap, Max Heap)

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

Huffman code.

Python functions for working with d-ary Heap (Heap with more than 2 child nodes) For more info (https://en.wikipedia.org/wiki/D-ary_heap)

Data structure projects designed as a TA for the Data Structures course at the University of Tehran (Spring 2023)

This project is a Python-based mini search engine that crawls web pages, indexes the content, and provides search functionalities based on keyword proximity and frequency. It leverages various data structures such as hash tables and min-heaps to efficiently manage and retrieve data.

A small package of basic data structures and algorithms; currently focusing on BinaryTrees and structures that utilize BinaryTrees. This is very much in development, but please take a look at the README.md and tell me what you think

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.

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

Given a list of locations which contain X and Y for distance return the nearest N locations using a min heap based on distance.

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