<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/minimum-depth-of-binary-tree/description/">Minimum Depth of Binary Tree - 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/0111/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/0111/main.fsx</a></p>
<pre><code class="lang-plaintext">type Tree =
    | Leaf
    | Node of int * Tree * Tree

let minDepth (root: Tree) : int =
    let rec minDepth' q depth =
        match q with
        | [] -&gt; depth
        | _ -&gt;
            let q', ok =
                q
                |&gt; List.fold
                    (fun (acc, ok) n -&gt;
                        if ok then
                            acc, ok
                        else
                            match n with
                            | Leaf -&gt; failwith "never reach here"
                            | Node(_, left, right) -&gt;
                                match left, right with
                                | Leaf, Leaf -&gt; acc, true
                                | Node(_), Leaf -&gt; left :: acc, false
                                | Leaf, Node(_) -&gt; right :: acc, false
                                | _ -&gt; right :: left :: acc, false)
                    ([], false)

            if ok then depth else minDepth' q' (depth + 1)

    match root with
    | Leaf -&gt; 0
    | _ -&gt; minDepth' [ root ] 1
</code></pre>


## URL

[Minimum Depth of Binary Tree - LeetCode](https://leetcode.com/problems/minimum-depth-of-binary-tree/description/)

## Code

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

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

let minDepth (root: Tree) : int =
    let rec minDepth' q depth =
        match q with
        | [] -> depth
        | _ ->
            let q', ok =
                q
                |> List.fold
                    (fun (acc, ok) n ->
                        if ok then
                            acc, ok
                        else
                            match n with
                            | Leaf -> failwith "never reach here"
                            | Node(_, left, right) ->
                                match left, right with
                                | Leaf, Leaf -> acc, true
                                | Node(_), Leaf -> left :: acc, false
                                | Leaf, Node(_) -> right :: acc, false
                                | _ -> right :: left :: acc, false)
                    ([], false)

            if ok then depth else minDepth' q' (depth + 1)

    match root with
    | Leaf -> 0
    | _ -> minDepth' [ root ] 1
```

LeetCode 111. Minimum Depth of Binary Tree in F#

URL

Code