Why is there such a big difference in memory usage between these two solutions (in Python) to finding the maximum depth of a binary tree? It looks like the first solution us
