Printable View
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.
A treeof 36000 nodes should only have a depth of 2log 36000 < 20, that should in no way result in a stack overflow. What are you doing exactly?
If you only call your function once in your recursion step, you can change the function to use a while loop instead of recursion.
Check how much stack space each function allocates. Try to reduce that.
wut is that suppose to mean? where did that math formula come from?Quote:
Originally posted by twanvl
A treeof 36000 nodes should only have a depth of 2log 36000 < 20
The depth of a perfectly balanced tree that splits into two nodes each time is log2(node count).
So a reason why you might have a stack overflow is that the tree is perhaps not balanced.