<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/n-ary-tree-level-order-traversal/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/n-ary-tree-level-orde..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0429/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 list)

let levelOrder (root: Tree) : int list list =
    let rec levelOrder' nodes acc =
        match nodes with
        | [] -&gt; acc |&gt; List.rev
        | _ -&gt;
            let vals, children =
                nodes
                |&gt; List.fold
                    (fun (vals, children) node -&gt;
                        match node with
                        | Leaf -&gt; vals, children
                        | Node (v, cs) -&gt; v :: vals, children @ cs)
                    ([], [])

            levelOrder' children ((vals |&gt; List.rev) :: acc)

    levelOrder' [ root ] []
</code></pre>


## URL

https://leetcode.com/problems/n-ary-tree-level-order-traversal/

## Code

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

```fsharp
type Tree =
    | Leaf
    | Node of int * (Tree list)

let levelOrder (root: Tree) : int list list =
    let rec levelOrder' nodes acc =
        match nodes with
        | [] -> acc |> List.rev
        | _ ->
            let vals, children =
                nodes
                |> List.fold
                    (fun (vals, children) node ->
                        match node with
                        | Leaf -> vals, children
                        | Node (v, cs) -> v :: vals, children @ cs)
                    ([], [])

            levelOrder' children ((vals |> List.rev) :: acc)

    levelOrder' [ root ] []
```

LeetCode 429. N-ary Tree Level Order Traversal in F#

URL

Code