- class Solution {
- public boolean isSubtree(TreeNode s, TreeNode t) {
- if (s == null || t == null) return s == t;
- if (isSame(s, t)) return true;
- return isSubtree(s.left, t) || isSubtree(s.right, t);
- }
- public boolean isSame(TreeNode s, TreeNode t) {
- if (s == null || t == null) return s == t;
- return s.val == t.val && isSame(s.left, t.left) && isSame(s.right, t.right);
- }
- }
class Solution { public boolean isSubtree(TreeNode s, TreeNode t) { if (s == null || t == null) return s == t; if (isSame(s, t)) return true; return isSubtree(s.left, t) || isSubtree(s.right, t); } public boolean isSame(TreeNode s, TreeNode t) { if (s == null || t == null) return s == t; return s.val == t.val && isSame(s.left, t.left) && isSame(s.right, t.right); } }