The minimum height of self balancing binary search tree with n nodes is _____

(a) log2(n)

(b) n

(c) 2n + 1

(d) 2n – 1

My question is from Binary Trees topic in portion Binary Trees of Data Structures & Algorithms I

This question was posed to me in homework.