Keywords

#red–black_tree

Red–black tree

Self-balancing binary search tree data structure

In computer science, a red–black tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information. The nodes in a red-black tree hold an extra "color" bit, often drawn as red and black, which help ensure that the tree is always approximately balanced.

Mon 29th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Red–black tree Red-black Left-leaning red–black tree WAVL tree AVL tree Binary search tree AA tree 2–3–4 tree Red and black Red-tailed black cockatoo
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.