https://leetcode.com/problems/invert-binary-tree/
解题思路:
这道题需要我们反转二叉树,可以认为是每一层的左右子节点互相交换。涉及到层序遍历,很容易想到维护一个队列,将左右子节点分别入列,接着再交换左右子节点。将队列弹出的节点作为下一次循环的根节点。
另外还有好几种方法,可以看看这个链接:
https://discuss.leetcode.com/topic/16039/straightforward-dfs-recursive-iterative-bfs-solutions/13
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) return null;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
TreeNode node = queue.poll();
if (node.left != null)
queue.offer(node.left);
if (node.right != null)
queue.offer(node.right);
TreeNode temp = node.left;
node.left = node.right;
node.right = temp;
}
return root;
}
}