Before revision:  This will be done by introducing a new data structure called Wise Red-Black Trees, a variation of classical Red-Black Trees. The goal is to improve time complexity, while also keeping spatial complexity to a minimum. The optimization will be visible both at the asymptote and in terms of multiplicative constants, affecting not only the worst-case, but also the average one .
After revision:  This will be done by introducing a new data structure called Wise Red-Black Trees, a variation of classical Red-Black Tree .