Guided tour

1. 💡01

   City Building Project Data Structures

   This project implements Min-Heap and Red-Black Tree data structures in Java for efficient city building simulations. It addresses the need for optimized data handling in urban planning applications.

   • !Focuses on data structures for city building
2. 🛠02

   Layered Monolithic Architecture

   The project is structured as a layered monolith, with separate Java files for each data structure and algorithm. This design promotes clear organization and modularity.

   • !Uses a layered architecture pattern
3. 📄03

   MinHeap.java - Core Data Structure

   The MinHeap.java file contains the implementation of the Min-Heap data structure, crucial for efficient priority queue operations in the project.

   MinHeap.java

   public class MinHeap {
       private int[] heap;
       private int size;
   
       public MinHeap(int capacity) {
           heap = new int[capacity];
           size = 0;
       }
   
       // Insert, remove, and other methods...
   }

4. ✓04

   No Tests Configured

   Currently, there are no tests configured for this project, indicating a potential area for improvement in ensuring code quality.

   • !No CI tests configured
5. 🚀05

   No CI/CD Workflows

   There are no CI/CD workflows configured for this project, which may limit automated testing and deployment capabilities.

   • !No CI/CD workflows present
6. ▶06

   Clone the Project

   To explore the project, you can clone the repository using the command below.

   git clone https://github.com/shashankcm95/Min-Heap-and-Red-black-tree-implementation-for-City-Building-Project

graph TD;
    A[User Input] --> B[Building.java];
    B --> C[MinHeap.java];
    B --> D[RedBlackTree.java];
    C --> E[Data Processing];
    D --> E;
    E --> F[Output Results];