<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/convert-sorted-array-..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0108/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 sortedArrayToBST (nums: int []) : Tree =
    let rec sortedArrayToBST' left right (nums: int []) =
        if left &gt; right then
            Leaf
        else
            let mid = (left + right) / 2
            Node(nums.[mid], sortedArrayToBST' left (mid - 1) nums, sortedArrayToBST' (mid + 1) right nums)

    sortedArrayToBST' 0 (nums.Length - 1) nums
</code></pre>


## URL

https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/

## Code

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

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

let sortedArrayToBST (nums: int []) : Tree =
    let rec sortedArrayToBST' left right (nums: int []) =
        if left > right then
            Leaf
        else
            let mid = (left + right) / 2
            Node(nums.[mid], sortedArrayToBST' left (mid - 1) nums, sortedArrayToBST' (mid + 1) right nums)

    sortedArrayToBST' 0 (nums.Length - 1) nums
```

Shohei Yoshida's Blog

Shohei Yoshida's Blog

LeetCode 108. Convert Sorted Array to Binary Search Tree in F#

URL

Code