LeetCode-226:翻转二叉树(Java语言实现)

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 * int val;
 * TreeNode left;
 * TreeNode right;
 * TreeNode() {}
 * TreeNode(int val) { this.val = val; }
 * TreeNode(int val, TreeNode left, TreeNode right) {
 * this.val = val;
 * this.left = left;
 * this.right = right;
 * }
 * }
 */
class Solution {
    public TreeNode invertTree(TreeNode root) {
        if (root == null) {
            return root;
        }
        f(root);
        return root;
    }

    public void f(TreeNode head) {
        if (head == null) {
            return;
        }
        TreeNode t = head.left;
        head.left = head.right;
        head.right = t;

        f(head.left);
        f(head.right);
    }
}