Algorithm that in keys, such that a search time in t' with let t be a time o(n) the following property. during find(x) operation in t', we visit < 1+log, n nodes of t' note showing only o(log n) is not sufficient cessarily balanced). suggest binary search tree (not ne construct a new t' containing the same an