Data structure for storing strings? -

I'm looking for a data structure to store strings. I need a function in the interface, which the string considers only gives the parameter and a reference / iterator / pointer / handle which can be used to obtain the string in the rest of the data structure. Set up membership, delete entry etc. No need.

I'm more concerned with using memory than Speed.

There is a highly efficient data structure for storing stars. It saves memory and time by storing stars with common prefixes using the same memory.

You can use as an indicator, which returns to the last marker of the string in the tree, which uniquely identifies the string, and the use of the troy to go back to the string to recreate the string is done.