+1 vote
in Data Structures & Algorithms I by (110k points)
What is the time complexity for inserting the string and forming a new string in the rope data structure?

(a) O (log n)

(b) O (n!)

(c) O (n^2)

(d) O (1)

The above asked question is from Binary Trees topic in section Binary Trees of Data Structures & Algorithms I

The question was asked by my school principal while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (a) O (log n)

For explanation: In order to perform the insertion on the rope data structure, one can insert the given string at any position x to form a new string in O (log n) time. So, the time complexity for worst case is O (log n). This can be done by one split operation and two concatenation operations.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.