2 ms·
Tail call elimination is an optimisation that is only possible for certain code patterns. How would you write a tail-recursive tree walk, without using a separa
by Retr0id 2y ago
Tail call elimination is an optimisation that is only possible for certain code patterns. How would you write a tail-recursive tree walk, without using a separate stack or queue data structure to store state?
- worthless-trash 2y agoChallenge accepted, I'll do it over my next long weekend.