As you can see after clicking the green flag, the recursively drawn tree makes 2^n calls for a depth of n. This appears to be very inefficient since many of the nodes are redundant. Is there any way to write the code to reduce the call count? Note you can change n via slider and redraw with "space"
Remixed by Larspolo, More games will come! Made by Schmams, https://scratch.mit.edu/users/Schmams/
