I originally thought this was pointless, since you can only recursively store data as far as it's actually done. But it all depends. ala...

node1
 subnode1
   subsubnode1
     ...
[download]

But if your language can refer to itself...

nodeA
  nodeB
nodeC
   referenceToNodeA
[download]

If the data's relations can be put into a graph that is not in the form of a tree, some recursive checks like the above can be invaluable. If it's in the form of a tree, w/ no cycles, things should be pretty safe so long as the data can be loaded into memory :)