forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathWhiteHyun.swift
More file actions
34 lines (32 loc) ยท 925 Bytes
/
WhiteHyun.swift
File metadata and controls
34 lines (32 loc) ยท 925 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
//
// 100. Same Tree
// https://leetcode.com/problems/same-tree/description/
// Dale-Study
//
// Created by WhiteHyun on 2024/05/12.
//
/**
* Definition for a binary tree node.
* public class TreeNode {
* public var val: Int
* public var left: TreeNode?
* public var right: TreeNode?
* public init() { self.val = 0; self.left = nil; self.right = nil; }
* public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }
* public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
* self.val = val
* self.left = left
* self.right = right
* }
* }
*/
extension TreeNode: Equatable {
public static func == (lhs: TreeNode, rhs: TreeNode) -> Bool {
lhs.val == rhs.val && lhs.left == rhs.left && lhs.right == rhs.right
}
}
final class Solution {
func isSameTree(_ p: TreeNode?, _ q: TreeNode?) -> Bool {
p == q
}
}