可以用递归或者层次遍历:递归的话就是先反转左右孩子,然后反转跟,层次遍历就直接遍历,反转就完了。
/**
* 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> q = new LinkedList<>();
q.add(root);
while(q.size() > 0) {
TreeNode top = q.poll();
//反转左右孩子
TreeNode left = top.left;
TreeNode right = top.right;
top.right = left;
top.left = right;
if(top.left != null) {
q.add(top.left);
}
if(top.right != null) {
q.add(top.right);
}
}
return root;
}
}