algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 17:44:10 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update solution 0700

Browse Source
This commit is contained in:
halfrost
2021-11-26 05:21:49 -08:00
committed by halfrost
parent a7ce19c62e
commit 8ff3546b5d
2 changed files with 33 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree.go
View File

@ -1,10 +1,20 @@
package leetcode
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
import (
"github.com/halfrost/LeetCode-Go/structures"
)
// TreeNode define
type TreeNode = structures.TreeNode
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func searchBST(root *TreeNode, val int) *TreeNode {
if root == nil {

24
leetcode/0700.Search-in-a-Binary-Search-Tree/README.md
View File

@ -1,4 +1,4 @@
# [700. Search in a Binary Search Tree](https://leetcode-cn.com/problems/search-in-a-binary-search-tree/)
# [700. Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)
## 题目
@ -38,13 +38,24 @@ Find the node in the BST that the node's value equals val and return the subtree
## 代码
```go
package leetcode
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
import (
"github.com/halfrost/LeetCode-Go/structures"
)
// TreeNode define
type TreeNode = structures.TreeNode
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func searchBST(root *TreeNode, val int) *TreeNode {
if root == nil {
@ -58,4 +69,5 @@ func searchBST(root *TreeNode, val int) *TreeNode {
return searchBST(root.Left, val)
}
}
```