rbtree
Here are 41 public repositories matching this topic...
A red–black tree is a self-balancing binary search tree. Each node of the binary tree has an extra bit, and that bit is interpreted as the color (red or black) of the node. These color bits are used to ensure the tree remains balanced during insertions and deletions.
-
Updated
May 16, 2020 - C
📔 A simple glossary implemented with red-black tree in C
-
Updated
Jun 20, 2021 - C
2ª Lista de exercícios relativa a disciplina de Análise de Algoritmos 2016.1 do curso de Ciência da Computação da Universidade Federal de Roraima
-
Updated
Aug 16, 2016 - C
🦠💉 System that accepts, processes, records and answers questions about cases of viruses 🧬💊
-
Updated
Mar 10, 2021 - C
eden project
-
Updated
Jul 6, 2021 - C
An implementation of the standard functions for red-black trees in C
-
Updated
Dec 9, 2020 - C
High Performance Light Weight Web Server
-
Updated
Aug 26, 2024 - C
1ª Lista de exercícios relativa a disciplina de Análise de Algoritmos 2016.1 do curso de Ciência da Computação da Universidade Federal de Roraima
-
Updated
Aug 14, 2016 - C
Red-black tree implementation in C
-
Updated
Jun 29, 2022 - C
The BEST, STL-standard red-black tree(rbtree)
-
Updated
Dec 12, 2020 - C
Prova Finale di Algoritmi e Strutture Dati - Polimi Ingegneria Informatica - a.a. 2018-2019
-
Updated
Nov 11, 2019 - C
Простая реализация Красно-чёрного дерева для работы с латинскими символами, которые упаковываются в 6-и битное поле
-
Updated
May 17, 2019 - C
Yet another red-black tree implementation
-
Updated
Oct 24, 2018 - C
Improve this page
Add a description, image, and links to the rbtree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the rbtree topic, visit your repo's landing page and select "manage topics."