Skip to content

Commit 5704380

Browse files
committed
add: solve #229 Subtree of Another Tree with ts
1 parent 0223ed2 commit 5704380

File tree

1 file changed

+51
-0
lines changed

1 file changed

+51
-0
lines changed
Lines changed: 51 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,51 @@
1+
/**
2+
* Definition for a binary tree node.
3+
* class TreeNode {
4+
* val: number
5+
* left: TreeNode | null
6+
* right: TreeNode | null
7+
* constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
8+
* this.val = (val===undefined ? 0 : val)
9+
* this.left = (left===undefined ? null : left)
10+
* this.right = (right===undefined ? null : right)
11+
* }
12+
* }
13+
*/
14+
15+
16+
/**
17+
* subTree๊ฐ€ root์˜ ํฌํ•จ๋˜๋Š”์ง€ ํ™•์ธํ•˜๋Š” ํ•จ์ˆ˜
18+
*
19+
* @param {TreeNode | null} root - ์ฃผ์–ด์ง„ ํŠธ๋ฆฌ
20+
* @param {TreeNode | null} subRoot - ํฌํ•จ๋˜๋Š”์ง€ ํ™•์ธํ•  ํŠธ๋ฆฌ
21+
* @returns {boolean} - subRoot๊ฐ€ root์— ํฌํ•จ๋˜๋Š”์ง€ ์—ฌ๋ถ€
22+
*
23+
* ์‹œ๊ฐ„ ๋ณต์žก๋„: O(n * m)
24+
* - `isSameTree`๋Š” ๋‘ ํŠธ๋ฆฌ๊ฐ€ ๋™์ผํ•œ์ง€ ํ™•์ธํ•˜๋Š”๋ฐ O(m) ์‹œ๊ฐ„์ด ๊ฑธ๋ฆผ (`m`: subRoot์˜ ๋…ธ๋“œ ์ˆ˜).
25+
* - `isSubtree`๋Š” `root`์˜ ๊ฐ ๋…ธ๋“œ์—์„œ `isSameTree`๋ฅผ ํ˜ธ์ถœํ•  ์ˆ˜ ์žˆ์Œ (`n`: root์˜ ๋…ธ๋“œ ์ˆ˜).
26+
* - ๋”ฐ๋ผ์„œ ์ตœ์•…์˜ ๊ฒฝ์šฐ O(n * m).
27+
*
28+
* ๊ณต๊ฐ„ ๋ณต์žก๋„: O(n)
29+
* - ์žฌ๊ท€ ํ˜ธ์ถœ์— ๋”ฐ๋ฅธ call stack ์‚ฌ์šฉ
30+
*/
31+
function isSubtree(root: TreeNode | null, subRoot: TreeNode | null): boolean {
32+
if (!subRoot) return true;
33+
if (!root) return false;
34+
35+
const isSameTree = (treeA: TreeNode | null, treeB: TreeNode | null ): boolean => {
36+
// ๋‘ ํŠธ๋ฆฌ ๋ชจ๋‘ null ์ธ ๊ฒฝ์šฐ true
37+
if (!treeA && !treeB) return true;
38+
// ํ•˜๋‚˜๋งŒ null ์ธ ๊ฒฝ์šฐ false
39+
if (!treeA || !treeB) return false;
40+
// val์ด ๋‹ค๋ฅธ ๊ฒฝ์šฐ false
41+
if (treeA.val !== treeB.val) return false;
42+
return isSameTree(treeA.left, treeB.left) && isSameTree(treeA.right, treeB.right)
43+
}
44+
45+
// ํ˜„์žฌ ๋…ธ๋“œ์—์„œ subRoot๊ฐ€ ์‹œ์ž‘๋˜๋Š” ํŠธ๋ฆฌ์ธ์ง€ ํ™•์ธ
46+
if (isSameTree(root, subRoot)) return true;
47+
48+
// ์™ผ์ชฝ, ์˜ค๋ฅธ์ชฝ ํ•˜์œ„ ํŠธ์— subRoot๊ฐ€ ํฌํ•จ๋˜๋Š”์ง€ ํ™•์ธ
49+
return isSubtree(root.left, subRoot) || isSubtree(root.right, subRoot)
50+
};
51+

0 commit comments

Comments
ย (0)