Maximum depth of a binary tree
Easytreedfsbfsrecursion
Return the number of nodes on the longest path from the root down to a leaf.
Examples write a tree level by level, with null for a missing child: [3,9,20,null,null,15,7].
Example 1
Input: root = [3,9,20,null,null,15,7] Output: 3
Example 2
Input: root = [1,null,2] Output: 2
Constraints
- 0 ≤ number of nodes ≤ 10⁴
- -100 ≤ Node.val ≤ 100
Submit checks your solution against 8 tests, including hidden ones.
// Provided by the judge: keep these definitions
class TreeNode {
constructor(val = 0, left = null, right = null) {
this.val = val
this.left = left
this.right = right
}
}
/**
* @param {TreeNode|null} root
* @return {int}
*/
function maxDepth(root) {
}