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

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