Invert a binary tree.
4 / \ 2 7 / \ / \ 1 3 6 9to
4 / \ 7 2 / \ / \ 9 6 3 1
题意:反转一颗二叉树
解题思路:
直接获取根节点的左右节点,然后进行交换即可。方法一使用二叉树层次遍历。
/**
* 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;
}
//存放当前节点
LinkedList<TreeNode> currLevel = new LinkedList<TreeNode>();
currLevel.add(root);
while (currLevel.size() > 0) {
//存放下一层节点
LinkedList<TreeNode> nextLevel = new LinkedList<TreeNode>();
while (!currLevel.isEmpty()) {
TreeNode node = currLevel.poll();
TreeNode temp = node.left;
node.left = node.right;
node.right = temp;
if (node.left != null) {
nextLevel.add(node.left);
}
if (node.right != null) {
nextLevel.add(node.right);
}
currLevel = nextLevel;
}
}
return root;
}
}
方法二是用递归
public TreeNode invertTree(TreeNode root)
{
if (root==null)
{
return null;
}
TreeNode left=root.left;
TreeNode right=root.right;
root.left=invertTree(right);
root.right=invertTree(left);
return root;
}