71: Ropes (Data Structure)
December 22, 2016
Posted by on
A rope is a data structure which stores long strings as a type of binary tree rather than a ‘monolithic’ list of characters. The nodes of the tree contain weights, and the leaves of the tree contain small substrings of the larger string.
A rope is advantageous over the latter structure with respect to speed of destructive concatenation, insertion, deletion, as well as extra memory required during operations, but is disadvantageous in speed of splitting, appending, and extra memory required while the structure is not being operated on.