> Non-strictness helps here more than TCO in a strict language. Can you explain? Assume I want to fold a function over a large tree and fully inspect the final

> Non-strictness helps here more than TCO in a strict language. Can you explain? Assume I want to fold a function over a large tree and fully inspect the final result. (For example, to compile a large expression to a piece of code.) If I use non-tail recursion, my stack will be exhausted. How does non-strictness help with stack usage?