Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
self-balancing binary search tree
|
| gptkbp:alternativeName |
symmetric binary B-tree
|
| gptkbp:complexity |
O(log n) for deletion
O(log n) for insertion O(log n) for search |
| https://www.w3.org/2000/01/rdf-schema#label |
red-black tree
|
| gptkbp:inventedBy |
gptkb:Rudolf_Bayer
1972 |
| gptkbp:property |
all leaves are black
each node is red or black red node cannot have red child root is always black every path from node to descendant leaves has same number of black nodes |
| gptkbp:relatedTo |
AVL tree
B-tree binary search tree |
| gptkbp:usedFor |
searching
data storage deletion insertion |
| gptkbp:usedIn |
gptkb:Java_TreeMap
gptkb:Java_TreeSet gptkb:STL_map gptkb:STL_set computer science |
| gptkbp:bfsParent |
gptkb:tree_(graph_theory)
gptkb:Completely_Fair_Scheduler |
| gptkbp:bfsLayer |
6
|