Question

Write down the Recurrence Relation for binary search tree; solve it using iterative method and give answer at the end in asymptotic form.

Answer 1

Recurrence means doing the same action repeatedly. We normally use recurrence Relation for binary search tree an solve using iterative method.

For example if we have to find the largest number using Recurrence relation for binary search tree  we will consider the array of numbers and then compare a pivot element with rest of the elements one by one to get the largets number.