/**
* 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) {
if(A == null || B == null) {
return false;
}
if(judge(A, B)) {
return true;
}
return isSubStructure(A.left, B) || isSubStructure(A.right, B);
}
boolean judge(TreeNode A, TreeNode B) {
if(A == null || B == null || A.val != B.val) {
return false;
}
boolean result = true;
if(B.left != null) {
result = judge(A.left, B.left);
}
if(B.right != null) {
result &= judge(A.right, B.right);
}
return result;
}
}