1. Create and initialize a temporary TreeNode variable with null.
2. If root is not null, recurse through its right nodes and also through its left nodes.
3. Swap the left node with the right node by using a temporary tree node variable. In this case, since the data is not a complicated object, you could also just swap the data values of the nodes.
4. Return the root node.
