All lookup and update operations have guaranteed expected Expense O(log n), but now regardless of any assumption on the input distribution. Additionally it is obvious that no factors higher than x will finish up within the still left sub-tree of x at any level in the process, and no factors lesse