Reversing a binary tree is so easy that even Joe Rogan can do it!
It's one of those questions that is asked a lot in a job interview because senior developers want to see how you work your way through the problem.
Just follow the algorithm: RE-BESII.
RE - Write the REverse Method
B - If both the left node and right node are null, return.
E - Else
S - Swap the nodes
I - If the left node is not null, send the left node to reverse.
I - If the right node is not null, send the right node to reverse.
And that's it! That's all you have to do.
The code for this can be found at:
https://github.com/mcbethr/ReverseABinaryTree
or
ryanmcbeth.com
