剑指 Offer 26. 树的子结构--递归

剑指 Offer 26. 树的子结构

class Solution {
    public boolean isSubStructure(TreeNode A, TreeNode B) {
        if(A==null || B==null)
            return false;
        if(A.val ==B.val && func(A.right,B.right) && func(A.left,B.left))
            return true;
        return isSubStructure(A.left,B) || isSubStructure(A.right,B);
    }

    private boolean  func(TreeNode a,TreeNode b){
        if(b==null) return true;
        if(a==null) return false;
        if(a.val == b.val)
            return func(a.left,b.left) && func(a.right,b.right);
        else
            return false;
    }
}