LeetCode剑指offer26 树的子结构(JAVA)

class Solution {
    public boolean isSubStructure(TreeNode A, TreeNode B) {
        if(A == null || B == null) 
            return false;
        return help(A, B) || isSubStructure(A.left, B) || isSubStructure(A.right, B);
    }
    public boolean help(TreeNode A, TreeNode B) {
        // 要先判断B是否为true,再判断A是否为true
        if(B== null )
            return true;
        if(A == null) 
            return false;
        return A.val == B.val && help(A.left, B.left) && help(A.right, B.right);
    }
}