700. 二叉搜索树中的搜索
/**
* 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 || root.Val == val {
return root
} else if (root.Val < val) {
return searchBST(root.Right, val)
} else {
return searchBST(root.Left, val)
}
return nil
}