/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
/**
* 输入两棵二叉树A,B,判断B是不是A的子结构。
* (ps:我们约定空树不是任意一个树的子结构)
*
* 只要a中含有b,那么遍历的结果串中,a串肯定包含b串
*
*
* */
public void preOrder(TreeNode root, StringBuilder rootString) {
if (root == null) {
return;
}
rootString.append(root.val + " ");
preOrder(root.left, rootString);
preOrder(root.right, rootString);
}
public boolean HasSubtree(TreeNode root1,TreeNode root2) {
if (root2==null) {
return false;
}
StringBuilder root1String = new StringBuilder();
preOrder(root1, root1String);
StringBuilder root2String = new StringBuilder();
preOrder(root2, root2String);
boolean tag = root1String.toString().contains(root2String);
return tag;
}
}