|
Definition of Red-black tree
1. Noun. (computing) A type of self-balancing binary search tree, typically used to implement associative arrays. ¹
¹ Source: wiktionary.com
|
1. Noun. (computing) A type of self-balancing binary search tree, typically used to implement associative arrays. ¹
¹ Source: wiktionary.com