I'm currently working on a program that creates a huge, and I mean huge, tree. The tree will probably have somewhere close to 36000 nodes. To create the tree I'm using a recursive algorithm which gives me a stackoverflow runtime error at about node #4000. What possible workarounds are there for this type of problem? Is there anyway to increase the amount of memory allocated to my program? This algorithm really only has to run once, so it's not a big problem that it is resource intensive.