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

let isSymmetric (root: Tree) : bool =
    let rec isSymmetric' left right =
        match left, right with
        | Leaf, Leaf -&gt; true
        | Leaf, _
        | _, Leaf -&gt; false
        | Node(v1, left1, right1), Node(v2, left2, right2) -&gt;
            v1 = v2 &amp;&amp; isSymmetric' left1 right2 &amp;&amp; isSymmetric' right1 left2

    isSymmetric' root root
</code></pre>


## URL

[Symmetric Tree - LeetCode](https://leetcode.com/problems/symmetric-tree/description/)

## Code

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

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

let isSymmetric (root: Tree) : bool =
    let rec isSymmetric' left right =
        match left, right with
        | Leaf, Leaf -> true
        | Leaf, _
        | _, Leaf -> false
        | Node(v1, left1, right1), Node(v2, left2, right2) ->
            v1 = v2 && isSymmetric' left1 right2 && isSymmetric' right1 left2

    isSymmetric' root root
```

Shohei Yoshida's Blog

Shohei Yoshida's Blog

LeetCode 101. Symmetric Tree in F#

URL

Code