Height / Max Depth of Binary Tree

You are given the root of a binary tree. Your task is to find and return the maximum depth of the tree. The maximum depth is the number of nodes along the longest path from the root to a leaf.

Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.

Please log in to access the Solution tab and view detailed answers and explanations.

Please log in to access the Discussion tab and join conversations with other participants.