[LeetCode] 226. Invert Binary Tree

题：https://leetcode.com/problems/invert-binary-tree/solution/

#题目
Invert a binary tree.

Example:

Input:

 4

/
2 7
/ \ /
1 3 6 9
Output:

 4

/
7 2
/ \ /
9 6 3 1
Trivia:
This problem was inspired by this original tweet by Max Howell:

Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so f*** off.

思路

递归，递归函数将传输节点的 左右子树互换。

code

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

def inverNode(node):
    if node == None:
        return None
    tmp = inverNode(node.right)
    node.right = inverNode(node.left)
    node.left = tmp
    return node

class Solution:
    def invertTree(self, root):
        """
        :type root: TreeNode
        :rtype: TreeNode
        """
        return inverNode(root)

递归函数 的输入是 结点，返回 已经将其左右子结点 交换的 结点。

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