Definitions from Wiktionary (red-black tree)
▸ noun: (computing) A type of self-balancing binary search tree, typically used to implement associative arrays.
▸ Words similar to red-black tree
▸ Usage examples for red-black tree
▸ Idioms related to red-black tree
▸ Wikipedia articles (New!)
▸ Words that often appear near red-black tree
▸ Rhymes of red-black tree
▸ Invented words related to red-black tree
▸ noun: (computing) A type of self-balancing binary search tree, typically used to implement associative arrays.
Similar:
AA tree,
B+ tree,
radix tree,
AVL tree,
trie,
binary indexed tree,
boron tree,
tree,
binary tree,
X-tree,
more...
▸ Words similar to red-black tree
▸ Usage examples for red-black tree
▸ Idioms related to red-black tree
▸ Wikipedia articles (New!)
▸ Words that often appear near red-black tree
▸ Rhymes of red-black tree
▸ Invented words related to red-black tree