Description:
Invert a binary tree.
Example:
Input:
4
/ \
2 7
/ \ / \
1 3 6 9
Output:
4
/ \
7 2
/ \ / \
9 6 3 1
题意:将一颗二叉树翻转;
解法:可以采用递归的方法来解决这道题;考虑一颗只有3个节点的二叉树,我们只需要将其左右节点对换就得到了翻转后的二叉树,同理,我们只需要将当前节点的左右节点为根的子树重复上述操作,即可完成整棵树的翻转;
Java
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) return null;
TreeNode left = invertTree(root.left);
TreeNode right = invertTree(root.right);
root.left = right;
root.right = left;
return root;
}
}