Question

What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine

Answer 1

Kth smallest element in a binary a search tree. Given a binary search tree, find k th smallest element in the binary search tree. For example, 5th smallest element in below binary search.

Answer 2

Answer:

hope this answer useful to you mate