Question 6
When is the complexity of search in a binary search tree O(n) and not O(log n)? (where n is the number of nodes in the tree.)