<h2 id="heading-url">URL</h2>
<a target="_blank" href="https://leetcode.com/problems/binary-tree-inorder-traversal/description/?envType=daily-question&amp;envId=2023-12-09">https://leetcode.com/problems/binary-tree-inorder-traversal/description/?envType=daily-question&amp;envId=2023-12-09</a>
<h2 id="heading-code">Code</h2>
<a target="_blank" href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/challenge/202312/binary_tree_inorder_traversal/main.fsx">https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/challenge/202312/binary_tree_inorder_traversal/main.fsx</a>
<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
 inorderTraversal' right (v :: acc')

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

## URL

[https://leetcode.com/problems/binary-tree-inorder-traversal/description/?envType=daily-question&envId=2023-12-09](https://leetcode.com/problems/binary-tree-inorder-traversal/description/?envType=daily-question&envId=2023-12-09)

## Code

[https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/challenge/202312/binary\_tree\_inorder\_traversal/main.fsx](https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/challenge/202312/binary_tree_inorder_traversal/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
            inorderTraversal' right (v :: acc')

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

LeetCode 94. Binary Tree Inorder Traversal in F#

URL

Code