Red-black-tree definition

(computing) A type of self-balancing binary search tree, typically used to implement associative arrays.
noun
0
0
Advertisement