<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/search-in-a-binary-search-tree/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/search-in-a-binary-se..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0700/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">type Tree =
    | Leaf
    | TreeNode of int * Tree * Tree

let rec searchBST (root: Tree) (value: int) : Tree =
    match root with
    | Leaf -&gt; Leaf
    | TreeNode (v, left, right) -&gt;
        if v = value then
            root
        else if value &lt; v then
            searchBST left value
        else
            searchBST right value
</code></pre>


## URL

https://leetcode.com/problems/search-in-a-binary-search-tree/

## Code

https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0700/main.fsx

```fsharp
type Tree =
    | Leaf
    | TreeNode of int * Tree * Tree

let rec searchBST (root: Tree) (value: int) : Tree =
    match root with
    | Leaf -> Leaf
    | TreeNode (v, left, right) ->
        if v = value then
            root
        else if value < v then
            searchBST left value
        else
            searchBST right value
```

LeetCode 700. Search in a Binary Search Tree in F#

URL

Code