JAVA实现判断树的子结构及树的镜像问题（《剑指offer》）

题目描述

输入两棵二叉树A，B，判断B是不是A的子结构。

/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    public boolean HasSubtree(TreeNode root1,TreeNode root2) {
        if(root1 == null || root2 == null) return false;
        return isEqual(root1, root2) || HasSubtree(root1.left, root2) || HasSubtree(root1.right, root2);
    }
     
    private boolean isEqual(TreeNode root1, TreeNode root2) {
        if(root2 == null) return true;
        if(root1 == null) return false;
        return root1.val == root2.val && isEqual(root1.left, root2.left) && isEqual(root1.right, root2.right);
    }
}

题目描述

操作给定的二叉树，将其变换为源二叉树的镜像。  

输入描述:

二叉树的镜像定义：源二叉树 
    	    8
    	   /  \
    	  6   10
    	 / \  / \
    	5  7 9 11
    	镜像二叉树
    	    8
    	   /  \
    	  10   6
    	 / \  / \
    	11 9 7  5

/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    public void Mirror(TreeNode root) {
         if(root == null){
         return;
     }
     TreeNode value = root.left;
     root.left = root.right;
     root.right = value;
     if(root.left != null){
         Mirror(root.left);
     }
     if(root.right != null){
         Mirror(root.right);
     }
    }
}