Algorithm implementation
Budget: $8 – $15 AUD
Explain why the longest path from a node x in a red black tree to a descendant leaf has
length at most twice that of the shortest path from node x to a descendant leaf.
This is fixed budget: 20AUD
length at most twice that of the shortest path from node x to a descendant leaf.
This is fixed budget: 20AUD