<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/binary-tree-inorder-traversal/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/binary-tree-inorder-t..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0094/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 inorderTraversal (root: Tree) : int list =
    let rec inorderTraversal' node acc =
        match node with
        | Leaf -&gt; acc
        | Node (v, left, right) -&gt;
            let acc' = inorderTraversal' left acc
            let acc'' = v :: acc'
            inorderTraversal' right acc''

    inorderTraversal' root [] |&gt; List.rev
</code></pre>


## URL

https://leetcode.com/problems/binary-tree-inorder-traversal/

## Code

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

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

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

    inorderTraversal' root [] |> List.rev
```

Shohei Yoshida's Blog

Shohei Yoshida's Blog

LeetCode 94. Binary Tree Inorder Traversal in F#

URL

Code