Leetcode572:判断另一棵树的子树
题目
解题思路
判断二叉树是否相等
代码示例
class Solution {
public boolean isSubtree(TreeNode s, TreeNode t) {
return Find(s, t);
}
public static boolean isSameTree(TreeNode p, TreeNode q) {
if (p == null && q == null) {
return true;
}
if (p == null || q == null) {
return false;
}
return p.val==q.val&&isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
}
public static boolean Find(TreeNode root, TreeNode t) {
if(root==null){
return false;
}
if(root.val==t.val){
if(isSameTree(root, t)){
return true;
}
}
if(Find(root.left, t)){
return true;
}
return Find(root.right, t);
}
}