Data Structures :: Trees - Discussion
Home > Data Structures > Trees > MCQs Questions Discussion
11 / 194
Choose the correct option.
The depth of a complete binary tree is given by
ADn = n log2 n
BDn = n log2 n+1
CDn = log2 n
DDn = log2 n+ t
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!