采用递归的思路,先从根节点开始判断,如果有其中一个为null都应该返回false,如果根节点不一致,则递归左子节点和右子节点
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isSubtree(TreeNode s, TreeNode t) {
boolean result = false;
if(s == null || t == null) return false;
result = isNodeEquals(s, t);
if (!result){
result = isSubtree(s.left,t);
}
if (!result){
result = isSubtree(s.right,t);
}
return result;
}
public boolean isNodeEquals(TreeNode s, TreeNode t) {
if (t == null) {
return s == null;
}
if (s == null) {
return t == null;
}
if (s.val != t.val) {
return false;
}
return isNodeEquals(s.left, t.left) && isNodeEquals(s.right, t.right);
}
}