[jj7779607] Week15

subtree-of-another-tree/limlimjo.js

@@ -0,0 +1,31 @@
+// n: root 노드 수, m: subRoot 노드 수
+// 시간복잡도: O(n*m)
+// 공간복잡도: O(n+m)
+
+/**
+ * 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) {
+    if (!subRoot) return true;
+    if (!root) return false;
+    if (sameTree(root, subRoot)) return true;
+
+    return isSubtree(root.left, subRoot) || isSubtree(root.right, subRoot)
+};
+
+function sameTree(root1, root2) {
+    if (!root1 && !root2) return true;
+    if (!root1 || !root2 || root1.val !== root2.val) return false;
+    return sameTree(root1.left, root2.left) && sameTree(root1.right, root2.right);
+
+};