The second project for my Spring 2018 CS class, Data Structures and Algorithms. It contains classes and headers for a binary search tree and a heap.

A program that once compiled creates two executable files. bst and primegap. bst takes as input first the number of integers and then the maximum value of an int plus one. With this input, an array is generated from the input given for the number of elements and their range. A Binary Search Tree is then created from the generated array. The BST …

Data structures implemented using C

its runs are created by BSTs

A simple bst implementation in C

Implementation of binary search trees & hashtables as dictionaries in pure C with comparison between them

p(t)sd

AVL tree: height-balanced trees in C supporting add, remove, search, update features. A comparison of AVL trees with red-black trees is also done(std::set).

2nd Sem - Data Structure In C

A program that takes values as input, and then sorts.

This repository contains all the questions and codes done in the CS-1203: Data Structures course at Ashoka University.

Prova finale di Algoritmi e Principi dell'Informatica - a.a. 2021-2022

This Repository contains C programming codes on DSA [Data Structure and Analysis] that I have learned in 3rd semester of Engineering college.

🗿 my old collection of classic data structures & algorithms implemented in C

An implementation of the standard functions for red-black trees in C

I'm extremely passionate about problem-solving, so I've created this repository to assist you in learning DSA using C. It covers all the essential concepts, including LinkedList, Stack, BST, and more. 🥰

Project carried out as part of the NF16 course at UTC. The project concerns the manipulation and management of binary integer interval search trees using the C language and the GTK3 graphical interface.

Implementação em linguagem C da ABB balanceada Árvore Rubro-Negra (Red-Black Tree)

This project provides a C-based solution to a hospital's patient record system. It uses a Binary Search Tree (BST) to manage patient data, offering fast search, insertion, and deletion of records. The system allows for data persistence through file storage and can organize records by patient ID or name.