package com.fishercoder.solutions;

import com.fishercoder.common.classes.TreeNode;

/**
 * 100. Same Tree
 * <p>
 * Given two binary trees, write a function to check if they are equal or not.
 * <p>
 * Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
 */

public class _100 {
    //recursion idea flows out naturally.
    public 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);
    }
}

@@ -106,24 +106,16 @@
 e Tree%0D%0A
- * %3Cp%3E%0D%0A
  * Given
@@ -190,16 +190,8 @@
 t.%0D%0A
- * %3Cp%3E%0D%0A
  * T
@@ -330,51 +330,10 @@
  %7B%0D%0A
-    //recursion idea flows out naturally.
 %0D%0A
+
     
@@ -557,18 +557,20 @@
 ight);%0D%0A
-
     %7D%0D%0A
+%0D%0A
 %7D%0D%0A

refactor 100