Vidyalelo
Data Structure · Q64

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 64

Q64

What is a time complexity for finding the total length of all string on all edges of a tree?

A.
Ɵ (n)
B.
Ɵ (n!)
C.
Ɵ (1)
D.
O (n2)
Answer

Answer: Option D

Solution

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