Given two binary trees with the same
structure, swap the values of their nodes.
Assume that the trees have the same structure so you don't need
to check on that in your code.
Simply traverse the two trees together, and swap the values of the roots, if they are not null.