Vidyalelo
Data Structure · Q103

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 103

Q103

What can be the maximum depth of the trie with n strings and m as the maximum sting the length?

A.
log2n
B.
log2m
C.
n
D.
m
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board