-
Notifications
You must be signed in to change notification settings - Fork 2
/
q0700.swift
57 lines (55 loc) · 1.31 KB
/
q0700.swift
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
//
// q0700.swift
// LeetcodeSwift
//
// Created by NowOrNever on 15/06/2020.
// Copyright © 2020 DL. All rights reserved.
//
import Foundation
//700. Search in a Binary Search Tree
//Easy
//
//711
//
//112
//
//Add to List
//
//Share
//Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node's value equals the given value. Return the subtree rooted with that node. If such node doesn't exist, you should return NULL.
//
//For example,
//
//Given the tree:
// 4
// / \
// 2 7
// / \
// 1 3
//
//And the value to search: 2
//You should return this subtree:
//
// 2
// / \
// 1 3
//In the example above, if we want to search the value 5, since there is no node with value 5, we should return NULL.
//
//Note that an empty tree is represented by NULL, therefore you would see the expected output (serialized tree format) as [], not null.
//
//Accepted
//153,103
//Submissions
//212,989
class q0700Solution {
func searchBST(_ root: TreeNode?, _ val: Int) -> TreeNode? {
guard let root = root else { return nil }
if root.val == val {
return root
}else if root.val > val {
return searchBST(root.left, val)
}else{
return searchBST(root.right, val)
}
}
}