In programming languages that do not provide a run-time heap and dynamic allocation and deal location, a storage pool of free nodes can be simulated using an array of structures (or parallel arrays). It is usually managed as a linked stack (see the next chapter) and allocate and deal locate operations are simply the push and pop operations for a stack.