The maximum height of a binary tree with n nodes is
a) log2(n) log_2(n) log2(n)
b) n−1n-1n−1
c) n n n
d) 2n 2n 2n
Create a free account to access the full topic