Re:Making robust software: the “Mars Code” talk (2012)
by adrianN on Monday February 15, 2016 @10:45AM
(#11103914)
Typically you don't use dynamic allocation, making trees much more tedious to implement. The usual data structure is a stack allocated constant size array.
But if you really have to use recursion, you can always simulate it with a loop and an explicit stack. This way it's also easy to bound the stack size.
But if you really have to use recursion, you can always simulate it with a loop and an explicit stack. This way it's also easy to bound the stack size.