LeetCode 226 翻转

问题：

解题思路：

把一个二叉树的 每一个节点的左右子树交换就会得到一个翻转之后的二叉树。

解题结果：

/**

* 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 null;

}

TreeNode temp = root.left;

root.left = root.right;

root.right = temp;

invertTree(root.left);

invertTree(root.right);



return root;

}

}