Is it possible to perform a split operation on a string in the rope if the split point is in the middle of the string.
I’m obligated to ask this question of Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I
I got this question during an internship interview.
Right answer is (a) True
Easiest explanation – In order to perform the splitting on the rope data structure, one can split the given string into two new string S1 and S2 in O (log n) time. So, the time complexity for worst case is O (log n). The split operation can be performed if the split point is either at the end of the string or in the middle of the string.