✨ [572] pretty simple

Author: enkr1

572/my_solution.js

@@ -0,0 +1,64 @@
+class TreeNode {
+  constructor(val, left, right) {
+    this.val = (val === undefined ? 0 : val);
+    this.left = (left === undefined ? null : left);
+    this.right = (right === undefined ? null : right);
+  }
+}
+
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} subRoot
+ * @return {boolean}
+ */
+const isSubtree = (root, subRoot) => {
+  let queue = [root];
+
+  const isNodeSame = (node, sub) => {
+    console.log("node")
+    console.log(node)
+    console.log("sub")
+    console.log(sub)
+    console.log(`node?.val?:${node?.val ?? null} !== sub.val:${sub?.val ?? null} -> ${(node?.val ?? null) !== sub?.val ?? null}`)
+
+    if ((node?.val ?? null) !== (sub?.val ?? null)) return false;
+
+    if (null === node && null === sub) {
+      console.log(">>> BOTH EMPTY")
+      return true;
+    }
+
+    return isNodeSame(node?.left ?? null, sub?.left ?? null) && isNodeSame(node?.right ?? null, sub?.right ?? null);
+  }
+
+  while (queue.length > 0) {
+    let curr = queue.shift(), left = curr.left, right = curr.right;
+    if (isNodeSame(curr, subRoot)) {
+      return true;
+    }
+
+    if (null !== left) queue.push(left);
+    if (null !== right) queue.push(right);
+  }
+
+  return false;
+};
+
+// Input: root = [3,4,5,1,2], subRoot = [4,1,2]
+// true
+
+let x =
+  // isSubtree(new TreeNode(3,
+  //   new TreeNode(4, new TreeNode(1), new TreeNode(2, new TreeNode(0))),
+  //   new TreeNode(5)),
+  //   new TreeNode(4, new TreeNode(1), new TreeNode(2))
+  // )
+
+  isSubtree(new TreeNode(3,
+    new TreeNode(4, new TreeNode(1), new TreeNode(2)),
+    new TreeNode(5)),
+    new TreeNode(4, new TreeNode(1), new TreeNode(2))
+  )
+
+console.log("Result")
+console.log(x)

572/solution.js

@@ -0,0 +1,31 @@
+class TreeNode {
+  constructor(val, left, right) {
+    this.val = (val === undefined ? 0 : val);
+    this.left = (left === undefined ? null : left);
+    this.right = (right === undefined ? null : right);
+  }
+}
+
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} subRoot
+ * @return {boolean}
+ */
+const isSubtree = (root, subRoot) => {
+  let queue = [root];
+
+  const isNodeSame = (node, sub) => {
+    if ((node?.val ?? null) !== (sub?.val ?? null)) return false;
+    if (null === node && null === sub) return true;
+    return isNodeSame(node?.left ?? null, sub?.left ?? null) && isNodeSame(node?.right ?? null, sub?.right ?? null);
+  }
+
+  while (queue.length > 0) {
+    let curr = queue.shift(), left = curr.left, right = curr.right;
+    if (isNodeSame(curr, subRoot)) return true;
+    if (null !== left) queue.push(left);
+    if (null !== right) queue.push(right);
+  }
+
+  return false;
+};

README.md

@@ -71,6 +71,7 @@
 - [424. Longest Repeating Character Replacement](./424/)
 - [435. Non-overlapping Intervals](./435/)
 - [530. Minimum Absolute Difference in BST](./530/)
+- [572. Subtree of Another Tree](./572/)
 - [647. Palindromic Substrings](./647/)
 - [771. Jewels and Stones](./771/)
 - [714. Best Time to Buy and Sell Stock with Transaction Fee](./714/)
@@ -140,7 +141,7 @@ Batch create:
 NOTE: JS IS HERE
 -->
 ```ssh
-chapter=226 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
+chapter=572 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
 ```
 > then you can use `x` for quick debug.