BST Analysis

Find: \(O(d)\)

Insert: \(O(d)\)

Delete: \(O(d)\)

\(d =\) depth of the tree

\(d\) is \(O(\log n)\) if the tree is balanced.

What is the worst case cost? When?