<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/minimum-distance-between-bst-nodes/">Minimum Distance Between BST Nodes - LeetCode</a></p>
<h2 id="heading-code">Code</h2>
<p><a target="_blank" href="https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/0783/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/0783/main.fsx</a></p>
<pre><code class="lang-plaintext">type Tree =
    | Leaf
    | Node of int * Tree * Tree

let minDiffInBST (root: Tree) : int =
    let rec collectValues node acc =
        match node with
        | Leaf -&gt; acc
        | Node(v, left, right) -&gt;
            let acc' = collectValues left (v :: acc)
            collectValues right acc'

    collectValues root []
    |&gt; List.sort
    |&gt; List.pairwise
    |&gt; List.fold (fun acc (v1, v2) -&gt; System.Math.Min(acc, v2 - v1)) System.Int32.MaxValue
</code></pre>


## URL

[Minimum Distance Between BST Nodes - LeetCode](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)

## Code

[https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/0783/main.fsx](https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/0783/main.fsx)

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

let minDiffInBST (root: Tree) : int =
    let rec collectValues node acc =
        match node with
        | Leaf -> acc
        | Node(v, left, right) ->
            let acc' = collectValues left (v :: acc)
            collectValues right acc'

    collectValues root []
    |> List.sort
    |> List.pairwise
    |> List.fold (fun acc (v1, v2) -> System.Math.Min(acc, v2 - v1)) System.Int32.MaxValue
```

LeetCode 783. Minimum Distance Between BST Nodes in F#

URL

Code