搜索与回溯算法（简单）02

剑指 Offer 26. 树的子结构

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSubStructure(TreeNode A, TreeNode B) {
        return (A!=null&&B!=null)&&(retcur(A,B)||isSubStructure(A.left,B)||isSubStructure(A.right,B));
    }
    public boolean retcur(TreeNode A,TreeNode B){
        if(B==null) return true;
        if(A==null||A.val!=B.val) return false;
        return retcur(A.left,B.left)&&retcur(A.right,B.right);
    }
}

剑指 Offer 28. 对称的二叉树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root) {
        return check(root,root);
    }
    public boolean check(TreeNode p,TreeNode q){
        if(p==null&&q==null) return true;
        if(p==null||q==null) return false;
        return p.val==q.val&&check(p.right,q.left)&&check(p.left,q.right);
    }
}

剑指 Offer 27. 二叉树的镜像

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode mirrorTree(TreeNode root) {
       if(root==null) return root;
       TreeNode tmp=root.left;
       root.left=mirrorTree(root.right);
       root.right=mirrorTree(tmp);
       return root;
    }
}