<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/invert-binary-tree/description/">https://leetcode.com/problems/invert-binary-tree/description/</a></p>
<h2 id="heading-code">Code</h2>
<p><a target="_blank" href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0226/main.fsx">https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0226/main.fsx</a></p>
<pre><code class="lang-plaintext">type Tree =
    | Leaf
    | Node of int * Tree * Tree

let rec invertTree (root: Tree) : Tree =
    match root with
    | Leaf -&gt; Leaf
    | Node (v, left, right) -&gt; Node(v, invertTree right, invertTree left)
</code></pre>


## URL

[https://leetcode.com/problems/invert-binary-tree/description/](https://leetcode.com/problems/invert-binary-tree/description/)

## Code

[https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0226/main.fsx](https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0226/main.fsx)

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

let rec invertTree (root: Tree) : Tree =
    match root with
    | Leaf -> Leaf
    | Node (v, left, right) -> Node(v, invertTree right, invertTree left)
```

LeetCode 226. Invert Binary Tree in F#

URL

Code