题目描述
操作给定的二叉树,将其变换为源二叉树的镜像。
输入描述:
二叉树的镜像定义为
源二叉树 :
8
/ \
6 10
/ \ / \
5 7 9 11
镜像二叉树:
8
/ \
10 6
/ \ / \
11 9 7 5
解题思路:
交互树的左右儿子节点,使用递归实现.
(递归实现,递归截止:root==null。
将左子树递归,右子树递归,然后root的left指向右子树,right指向左子树)
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
//操作给定的二叉树,将其变换为源二叉树的镜像。
public void Mirror(TreeNode root) {
if(root == null){
return;
}
TreeNode left = root.left;
TreeNode right = root.right;
Mirror(left);
Mirror(right);
root.left = right;
root.right = left;
}
/**
* 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 root;
}
TreeNode left = invertTree(root.left);
TreeNode right = invertTree(root.right);
root.left = right;
root.right = left;
return root;
}
}
c++:
TreeNode* invertTree(TreeNode* root) {
if (root == nullptr) {
return nullptr;
}
TreeNode *tmp = root->left;
root->left = root->right;
root->right = tmp;
if (root->left) {
invertTree(root->left);
}
if (root->right) {
invertTree(root->right);
}
return root;
}