Before revision:  This will be done by introducing a new data structure called Wise Red-Black Trees, a variation of classical Red-Black Trees.
After revision:  The goal is to improve existing solutions, by optimizing the average-case time complexity and getting rid of heavy multiplicative constants in the worst-case, without sacrificing space complexity. This is an high-impact operation in practical applications, and will be performed by introducing a new data structure called Wise Red-Black Trees, a variation of classical Red-Black Trees.