java实现输入两棵二叉树A，B，判断B是不是A的子结构

class TreeNode {
	int val = 0;
	TreeNode left = null;
	TreeNode right = null;

	public TreeNode(int val) {
		this.val = val;

	}

}

public class FindSonTree {
	public boolean HasSubtree(TreeNode root1, TreeNode root2) {
		boolean result = false;
		if (root1 != null && root2 != null) {
			if (root1.val == root2.val)
				result = isHasSubtree(root1, root2);
			if (!result) {
				result = HasSubtree(root1.left, root2);
			}
			if (!result) {
				result = HasSubtree(root1.right, root2);
			}
		}
		return result;
	}

	boolean isHasSubtree(TreeNode root1, TreeNode root2) {

		if (root2 == null)
			return true;
		if (root1 == null)
			return false;

		if (root1.val != root2.val)
			return false;

		return isHasSubtree(root1.left, root2.left) && isHasSubtree(root1.right, root2.right);

	}

	public static void main(String[] args) {
		// 8,#,8,#,9,#,2,#,5
		TreeNode root1 = new TreeNode(8);
		root1.left = new TreeNode('#');
		root1.right = new TreeNode(8);
		root1.left.left = new TreeNode('#');
		root1.left.right = new TreeNode(9);
		root1.left.right.left = new TreeNode('#');
		root1.left.right.right = new TreeNode(2);
		TreeNode root2 = new TreeNode(8);
		root2.left = new TreeNode('#');
		root2.right = new TreeNode(9);
		root2.left.left = new TreeNode(3);
		root2.left.right = new TreeNode(2);
		// TreeNode root1 = new TreeNode(8);
		// root1.left = new TreeNode(8);
		// root1.right = new TreeNode(7);
		// root1.left.left = new TreeNode(9);
		// root1.left.right = new TreeNode(2);
		// root1.left.right.left = new TreeNode(4);
		// root1.left.right.right = new TreeNode(7);
		// TreeNode root2 = new TreeNode(8);
		// root2.left = new TreeNode(9);
		// root2.right = new TreeNode(2);

		FindSonTree f = new FindSonTree();
		System.out.println(f.HasSubtree(root1, root2));
	}

}