<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/count-complete-tree-nodes/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/count-complete-tree-n..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0222/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 countNodes (root: Tree) : int =
    match root with
    | Leaf -&gt; 0
    | Node (_, left, right) -&gt; 1 + countNodes left + countNodes right
</code></pre>


## URL

https://leetcode.com/problems/count-complete-tree-nodes/

## Code

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

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

let rec countNodes (root: Tree) : int =
    match root with
    | Leaf -> 0
    | Node (_, left, right) -> 1 + countNodes left + countNodes right
```

Shohei Yoshida's Blog

Shohei Yoshida's Blog

LeetCode 222. Count Complete Tree Nodes in F#

URL

Code