Project Summary
A well documented, simple and straight-forward implementation of a red-black-binary search tree generic collection.
This template class is fully compatible with the C++ standard template library (STL) algorithms.
This project is meant for students and c++ programmers who want to learn about red-black trees.
Also, this class demonstrates how simple is to write a STL-compatible collection.
In order to fully understand this implementation, you shuold be familiar with the STL, emphasizing the concept of iterators.
In a Nutshell, Red-Black Binary Search Tree - Generic...
GNU General Public License v2.0 or later
Permitted
Commercial Use
Modify
Distribute
Place Warranty
Forbidden
Sub-License
Hold Liable
Required
Distribute Original
Disclose Source
Include Copyright
State Changes
Include License
These details are provided for information only. No information here is legal advice and should not be used as such.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
in 2016, 47% of companies did not have formal process in place to track OS code
-
...
data presented on the Open Hub is available through our API
-
...
there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
-
...
search using multiple tags to find exactly what you need
