Binary Tree Max Depth Coding Interview Question | Skilled.dev
Given the root node of a binary tree, write a function findMaxDepth that returns an integer corresponding to the maximum depth.
The maximum depth is going to be the node with the level furthest from the root. The root node is a 0 depth, and an empty input would be considered -1.
The tree nodes will use the following implementation: