What is the expected depth of a node in a randomized binary search tree?

(a) log n

(b) n!

(c) n^2

(d) 2 log n + O(1)

Asked question is from Binary Trees topic in section Binary Trees of Data Structures & Algorithms I

This question was posed to me in quiz.