Design a theoretical infinite recursive data structure called a 'Nest' that can hold any data type or another 'Nest'. Explain the algorithmic complexity of traversing this structure to find a specific primitive value. Discuss memory management strategies for such a system, specifically addressing how the depth of the nesting impacts the stack overflow risk and how one might implement tail-call optimization or flattening techniques to mitigate it. Ensure the explanation details how each node knows exactly what is contained within it.