insertion: O(lg n)
rotation: O(lg n)
deletion: O(lg n)
In many cases, such as maintaining the size attributes in order-statistic trees, the cost of updating after a rotation is O(1), rather than the O(lg n).
저는 서영준 입니다.
insertion: O(lg n)
rotation: O(lg n)
deletion: O(lg n)
In many cases, such as maintaining the size attributes in order-statistic trees, the cost of updating after a rotation is O(1), rather than the O(lg n).