<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/trim-a-binary-search-tree/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/trim-a-binary-search-..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0669/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
    | Node of int * Tree * Tree

let rec trimBST (root: Tree) (low: int) (high: int) =
    match root with
    | Leaf -&gt; Leaf
    | Node (v, left, right) -&gt;
        let left' = trimBST left low high
        let right' = trimBST right low high

        if v &gt;= low &amp;&amp; v &lt;= high then
            Node(v, left', right')
        else
            match left' with
            | Leaf -&gt; right'
            | _ -&gt; left'
</code></pre>


## URL

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

## Code

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

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

let rec trimBST (root: Tree) (low: int) (high: int) =
    match root with
    | Leaf -> Leaf
    | Node (v, left, right) ->
        let left' = trimBST left low high
        let right' = trimBST right low high

        if v >= low && v <= high then
            Node(v, left', right')
        else
            match left' with
            | Leaf -> right'
            | _ -> left'
```

LeetCode 669. Trim a Binary Search Tree in F#

URL

Code