Skip to content

Latest commit

 

History

History
23 lines (14 loc) · 660 Bytes

File metadata and controls

23 lines (14 loc) · 660 Bytes

Data Structures in C

This repo is a little playground of C data structures.
PS: Each folder is a self-contained project

📂 C-Linked-List — Sparse Matrix

A memory-efficient way to store matrices using linked lists.

  • Only keeps non-zero values to save space.
  • View as a grid or raw linked list.
  • Supports in-place matrix addition.
  • Simple menu to search, edit, and check memory usage.

📂 C-BST — Interval Reservation System

A Binary Search Tree that manages bookings without overlaps.

  • Each node stores a time range, company ID, and notes.
  • Add, update, search, and delete reservations.
  • Filter by company or time range.