About this question
Easy · Code Analysis · Quant Trader interview question · recursion, stack-overflow, option-pricing, binomial-tree
You are developing an option pricing model using a recursive function. The function calculates the option price at a given node in a binomial tree by averaging the discounted option prices of the two possible successor nodes. You've noticed that for very deep trees (many time steps), your program crashes. What is the most likely cause of this issue?