Red-Black Tree C Code. The following C files implement balanced binary trees using the red-black paradigm. I have written these functions in a very general manner so that the key can be anything at all. Each node of the balanced binary tree must contain a key and a pointer to info. The user defines what data-type the key is and provides a comparison function for the keys. The info can also be any kind of data type. You might also want to take a look at the C++ version of red black trees and interval trees.
Keywords for this software
References in zbMATH (referenced in 1 article )
Showing result 1 of 1.
- Weihs, Luca; Drton, Mathias; Leung, Dennis: Efficient computation of the Bergsma-Dassios sign covariance (2016)