Editor">
Editor Staff asked 5 months ago
Editor Staff asked 5 months ago
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 Answers
Editor">Editor Staff answered 5 months ago
Editor Staff answered 5 months ago
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).
