Given a balanced binary search tree that somehow allows duplicates populated by a sequence S of n elements on which a total order relation is defined, describe an efficient algorithm for determining whether there are two equal elements in S.
What is the running time of your algorithm?