I&#x27;m not really sure what amortization you&#x27;re talking about here.<p>BSTs are O(n) lookup, and the pathological case is quite easy to achieve: add elements to it in sorted order.<p>There are other trees that have O(lg n) lookup. Red-black trees are the canonical example.