package com.fishercoder.solutions;

import com.fishercoder.common.classes.TreeNode;

/**
 * 572. Subtree of Another Tree
 Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node's descendants. The tree s could also be considered as a subtree of itself.

 Example 1:
 Given tree s:

     3
    / \
   4   5
  / \
 1   2
 Given tree t:
   4
  / \
 1   2
 Return true, because t has the same structure and node values with a subtree of s.

 Example 2:
 Given tree s:

     3
    / \
   4   5
  / \
 1   2
    /
   0

 Given tree t:
   4
  / \
 1   2
 Return false.
 */
public class _572 {
    public boolean isSubtree(TreeNode s, TreeNode t) {
        if (s == null && t == null) return true;
        return dfs(s, t);
    }

    private boolean dfs(TreeNode s, TreeNode t) {
        boolean isSubTree = false;
        if (s != null && t != null && s.val == t.val) isSubTree = isSameTree(s, t);
        if (isSubTree) return true;
        boolean isSubTreeLeft = false;
        if (s.left != null) isSubTreeLeft= dfs(s.left, t);
        if (isSubTreeLeft) return true;
        boolean isSubTreeRight = false;
        if (s.right != null) isSubTreeRight = dfs(s.right, t);
        if (isSubTreeRight) return true;
        return false;
    }

    private boolean isSameTree(TreeNode p, TreeNode q) {
        if(p == null || q == null) return p == q;
        return p.val == q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
    }
}

@@ -724,16 +724,17 @@
  _572 %7B%0A
+%0A
     publ
@@ -833,91 +833,8 @@
 ue;%0A
-        return dfs(s, t);%0A    %7D%0A%0A    private boolean dfs(TreeNode s, TreeNode t) %7B%0A
     
@@ -1066,19 +1066,25 @@
 eeLeft= 
-dfs
+isSubtree
 (s.left,
@@ -1218,11 +1218,17 @@
 t = 
-dfs
+isSubtree
 (s.r

edit 572