<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/increasing-order-search-tree/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/increasing-order-sear..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0897/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 rec appendRight (root: Tree) (node: Tree) : Tree =
    match root with
    | Leaf -&gt; node
    | Node (v, _, right) -&gt; Node(v, Leaf, (appendRight right node))

let rec increasingBST (root: Tree) : Tree =
    match root with
    | Leaf -&gt; Leaf
    | Node (v, left, right) -&gt;
        let ret1 = increasingBST left
        let ret2 = increasingBST right

        let ret = appendRight ret1 (Node(v, Leaf, Leaf))
        appendRight ret ret2
</code></pre>


## URL

https://leetcode.com/problems/increasing-order-search-tree/

## Code

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

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

let rec appendRight (root: Tree) (node: Tree) : Tree =
    match root with
    | Leaf -> node
    | Node (v, _, right) -> Node(v, Leaf, (appendRight right node))

let rec increasingBST (root: Tree) : Tree =
    match root with
    | Leaf -> Leaf
    | Node (v, left, right) ->
        let ret1 = increasingBST left
        let ret2 = increasingBST right

        let ret = appendRight ret1 (Node(v, Leaf, Leaf))
        appendRight ret ret2
```

LeetCode 897. Increasing Order Search Tree in F#

URL

Code