+1 vote
in Data Structures & Algorithms I by (110k points)
Is insertion and deletion operation faster in rope than an array?

(a) True

(b) False

This intriguing question originated from Binary Trees topic in section Binary Trees of Data Structures & Algorithms I

I got this question in an interview for job.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right choice is (a) True

Best explanation: In order to perform the insertion on the rope data structure, the time complexity is O (log n). In order to perform the deletion on the rope data structure, the time complexity for worst case is O (log n). While for arrays the time complexity is O (n).

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.

Categories

...