Question 33 of 75 - LeetCode Weekly Challenge

LeetCode Challenge #104. Maximum Depth of Binary Tree

Given the root of a binary tree, return its maximum depth.

A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.


Example 1:

tmp tree
Input: root = [3,9,20,null,null,15,7]
Output: 3

Example 2:

Input: root = [1,null,2]
Output: 2



  • The number of nodes in the tree is in the range [0, 104].
  • -100 <= Node.val <= 100
Video Solution
C++ Solution
					class Solution {
    int findDepth(TreeNode* root)
        if(root==NULL)return 0;
        int left= findDepth(root->left);
        int right= findDepth(root->right);
        return (max(left,right)+1);
    int maxDepth(TreeNode* root) {
        return findDepth(root);

Happy Coding with edSlash