We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 098c1b0 commit 004dce7Copy full SHA for 004dce7
same-tree/eunhwa99.kt
@@ -0,0 +1,20 @@
1
+package leetcode_study
2
+
3
+class TreeNode(var `val`: Int) {
4
+ var left: TreeNode? = null
5
+ var right: TreeNode? = null
6
+}
7
8
+// Time Complexity: O(n)
9
+// Space Complexity: O(h) where h is the height of the tree (재귀함수로 인한 공간 복잡도)
10
+class Solution {
11
+ fun isSameTree(p: TreeNode?, q: TreeNode?): Boolean {
12
+ return if (p == null && q == null) {
13
+ true
14
+ } else if (p == null || q == null || p.`val` != q.`val`) {
15
+ false
16
+ } else {
17
+ isSameTree(p.left, q.left) && isSameTree(p.right, q.right)
18
+ }
19
20
0 commit comments