<h3 id="heading-url">URL</h3>
<p><a href="https://leetcode.com/problems/maximum-depth-of-binary-tree/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/maximum-depth-of-bina..</a></p>
<h3 id="heading-code">Code</h3>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0104/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
    | TreeNode of int * Tree * Tree

let rec maxDepth (r: Tree) : int =
    match r with
    | Leaf -&gt; 0
    | TreeNode (_, left, right) -&gt; (max (maxDepth left) (maxDepth right)) + 1
</code></pre>


### URL

https://leetcode.com/problems/maximum-depth-of-binary-tree/

### Code

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

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

let rec maxDepth (r: Tree) : int =
    match r with
    | Leaf -> 0
    | TreeNode (_, left, right) -> (max (maxDepth left) (maxDepth right)) + 1
```

LeetCode 104. Maximum Depth of Binary Tree in F#

URL

Code