88) The depth of a complete binary tree with 'n nodes is (log is to be base two)
Answer is:
log (n+1)-1
Related Data structures and Algorithms MCQ with Answers
Answer is:
Counting the number of key operations
Answer is: