Vidyalelo
Data Structure · Q271

Binary Search Trees(B Tree)

Programming · Data Structure · question 271

Q271

What is the time complexity for splitting the string into two new string in the rope data structure?

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

Answer: Option C

Solution

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