25 lines
450 B
Go
25 lines
450 B
Go
// Package q700 implements a solution for https://leetcode.com/problems/search-in-a-binary-search-tree/
|
|
package q700
|
|
|
|
type TreeNode struct {
|
|
Val int
|
|
Left *TreeNode
|
|
Right *TreeNode
|
|
}
|
|
|
|
func searchBST(root *TreeNode, val int) *TreeNode {
|
|
if root == nil {
|
|
return nil
|
|
}
|
|
|
|
switch {
|
|
case val == root.Val:
|
|
return root
|
|
case val > root.Val:
|
|
return searchBST(root.Right, val)
|
|
default:
|
|
return searchBST(root.Left, val)
|
|
}
|
|
}
|
|
|
|
var _ = searchBST
|