Invert a Binary Tree | Recursion Done Right

Yes, we know mirrors don't swap left and right, they really push "front" through "back" 😂 but I think you get the idea in this problem.

[samuraijosh]

I wish leetcode accepted more functional languages that support tail call optimizations. You wouldn't have to write an iterative solution to an inherently recursive problem at all!