The minimum height of an AVL tree with n nodes is
(A) Ceil (log2 (n + 1))
(B) 1.44 log2 n
(C) Floor (log2 (n + 1))
(D) 1.64 log2 n
All Replies
Viewing 1 replies (of 1 total)
Viewing 1 replies (of 1 total)
- You must be logged in to reply to this topic.