<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/range-sum-of-bst/description/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/range-sum-of-bst/desc..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0938/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 rangeSumBST (root: Tree) (low: int) (high: int) : int =
    let rec rangeSumBST' node low high acc =
        match node with
        | Leaf -&gt; acc
        | Node(v, left, right) -&gt;
            let acc' = if v &gt;= low &amp;&amp; v &lt;= high then acc + v else acc
            let acc'' = rangeSumBST' left low high acc'
            rangeSumBST' right low high acc''

    rangeSumBST' root low high 0
</code></pre>


## URL

https://leetcode.com/problems/range-sum-of-bst/description/

## Code

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

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

let rangeSumBST (root: Tree) (low: int) (high: int) : int =
    let rec rangeSumBST' node low high acc =
        match node with
        | Leaf -> acc
        | Node(v, left, right) ->
            let acc' = if v >= low && v <= high then acc + v else acc
            let acc'' = rangeSumBST' left low high acc'
            rangeSumBST' right low high acc''

    rangeSumBST' root low high 0
```

LeetCode 938. Range Sum of BST in F#

URL

Code