Date: 2024-11-03 12:59:35
Score: 4.5
Natty:
It is easy to find ith smallest in a O(Log n) time which is better than O(n).
The approach is to augment the RB tree into an Order statistics tree.
the detailed explaination is found at
https://cexpertvision.com/2024/11/03/augmenting-data-structures/
https://www.youtube.com/watch?v=kqdX4jsdYJM
Reasons:
- Blacklisted phrase (1): youtube.com
- Probably link only (1):
- Low length (0.5):
- No code block (0.5):
- Unregistered user (0.5):
- Low reputation (1):