The minimum height of a binary tree with n nodes is
a) 2log2(n) 2log_2(n) 2log2(n)
b) ln(n) ln(n) ln(n)
c) log2(n) log_2(n) log2(n)
d) logn(2) log_n(2) logn(2)
Create a free account to access the full topic