/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/classSolution{publicbooleanisSubStructure(TreeNode A, TreeNode B){return(A!=null&&B!=null)&&(recur(A,B)||isSubStructure(A.left,B)||isSubStructure(A.right,B));}booleanrecur(TreeNode A,TreeNode B){if(B==null){returntrue;}if(A==null||A.val!=B.val){returnfalse;}returnrecur(A.left,B.left)&&recur(A.right,B.right);}}