What is the only condition that would cause dynamic data structure to return . . ."

[dseals22]

What is the only condition that would cause the Insert operation of a dynamic data structure to return a “data structure full” error?

I want to know where can I find some resources on this question at, because as of researching for a day and half, I couldn't find information specific to my question. Can anyone help me answer my question? I know that dynamic data structures (such as linked lists) can expand the amount of nodes at runtime, but if that's the case, how could it ever return a "full error" message if has an unlimited amount of storage to get keep holding nodes inside of it?

[Frinavale]

This error all depends on the implementation of the structure that you are using and it the rules/specifications that it follows.

You will have to find some documentation on the data structure that you are working with to find out what errors it throws and when (what the cause is).