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 C program that makes RedBlack trees and Binary search trees.

High-level C binding for ØMQ

a generic data structure written in pure C, uses macros heavily 😂

Main project including all the subprojects and editor files

Implementation in C of binary search tree and AVL tree

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 …

its runs are created by BSTs

A simple bst implementation in C

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

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

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

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.

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.

Trabalho final da cadeira Estrutura de Dados 2017/02

Main data structures array-based and linkd-based implementation in C.

Binary Search Tree (BST) for strings in C89