一、题目
二、代码
/**
* 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;
Queue<TreeNode> re = new LinkedList<>();
re.offer(root);
while(!re.isEmpty())
{
int i;
int length = re.size();
for(i=0;i<length;i++)
{
TreeNode re_node = re.poll();
if(re_node.left != null) re.offer(re_node.left);
if(re_node.right != null) re.offer(re_node.right);
TreeNode temp = re_node.left;
re_node.left = re_node.right;
re_node.right = temp;
}
}
return root;
}
}