输入两棵二叉树A和B,判断B是不是A的子结构。(约定空树不是任意一个树的子结构)
B是A的子结构, 即 A中有出现和B相同的结构和节点值。
示例 1:
输入:A = [1,2,3], B = [3,1]
输出:false
示例 2:
输入:A = [3,4,5,1,2], B = [4,1]
输出:true
/**
* 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 (isSubTree(A, B)) return true;
return isSubStructure(A.left, B) || isSubStructure(A.right, B);
}
// 判断以A中每个结点为根的子树是否包含B
public boolean isSubTree(TreeNode A, TreeNode B) {
if (B == null) return true;
if (A == null) return false;
if (A.val != B.val) return false;
return isSubTree(A.left, B.left) && isSubTree(A.right, B.right);
}
}