Add solution #572

Author: JoshCrozier

README.md

@@ -450,6 +450,7 @@
 565|[Array Nesting](./0565-array-nesting.js)|Medium|
 566|[Reshape the Matrix](./0566-reshape-the-matrix.js)|Easy|
 567|[Permutation in String](./0567-permutation-in-string.js)|Medium|
+572|[Subtree of Another Tree](./0572-subtree-of-another-tree.js)|Easy|
 575|[Distribute Candies](./0575-distribute-candies.js)|Easy|
 589|[N-ary Tree Preorder Traversal](./0589-n-ary-tree-preorder-traversal.js)|Easy|
 594|[Longest Harmonious Subsequence](./0594-longest-harmonious-subsequence.js)|Easy|

solutions/0572-subtree-of-another-tree.js

@@ -0,0 +1,31 @@
+/**
+ * 572. Subtree of Another Tree
+ * https://leetcode.com/problems/subtree-of-another-tree/
+ * Difficulty: Easy
+ *
+ * Given the roots of two binary trees root and subRoot, return true if there is a subtree of
+ * root with the same structure and node values of subRoot and false otherwise.
+ *
+ * A subtree of a binary tree tree is a tree that consists of a node in tree and all of this
+ * node's descendants. The tree tree could also be considered as a subtree of itself.
+ */
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(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}
+ */
+var isSubtree = function(root, subRoot) {
+  return traverse(root).includes(traverse(subRoot));
+  function traverse(node) {
+    return !node ? '#' : `,${node.val},${traverse(node.left)},${traverse(node.right)}`;
+  }
+};