In a Red-Black tree, what color must the root always be?
Show answer
Black
This is one of the five essential Red-Black tree properties. If an operation turns the root red, it is immediately recolored black to maintain the tree's balance constraints.
Would you remember this in 6 months?
Trivia Forge uses spaced repetition so facts stick. Free, no signup needed.
Turn on Algorithms practice →More Algorithms trivia
- In an AVL tree, what is the maximum allowed difference in height between the left and right subtrees of any node?
- In hash tables, what is the name of the collision resolution technique where each bucket contains a pointer to a linked list of records?
- In the context of NP-completeness, what is the term for a problem that is at least as hard as the hardest problems in NP, but might not be in NP itself?
- In the context of optimization, what is the primary difference between the items in the Fractional Knapsack problem versus the 0/1 Knapsack problem?
- In the context of the Ford-Fulkerson method, what is a path from the source to the sink in the residual graph called?
- In the Master Theorem formula T(n) = aT(n/b) + f(n), what does the constant 'a' represent?