1. A method of saving an interlocking trees data store from a memory wherein said interlocking trees datastore has at least one BOT node, at least one subcomponent node and at least a plurality of root nodes, wherein said BOT nodes have a list of asCase pointers to subcomponent nodes, wherein said subcomponent nodes have a list of asCase pointers to other subcomponent nodes and wherein said root nodes have a list of asResult pointers to subcomponent nodes that depend from said BOT node, wherein said method comprises: traversing the interlocking trees data store to access each node, creating a node packet for each node wherein said node packet creation process includes at least capturing a case pointer and a result pointer for each node, but not capturing pointers from said asCase list and not capturing pointers from said asResult list, and writing the node packet to another memory.