Question

What kind of storage structure for strings can one easy insert delete account date and rearrange substrings?

Answer 1

Which data structure can be used for efficiently building a word dictionary and Spell ... upon the functionalists required in Spell Checker and availability of memory. ... Prefix search is something where a user types a prefix and your dictionary ... With Trie, we can support all operations like insert, search, delete in O(n) time ..

Answer 2

In linked list one can easily insert, delete, concatenate and rearrange substrings. A linked list is a linear data structure,where each element is a separate object. The elements in a linked list are linked using pointers.

hope it helps you to