Max Depth of Binary Tree

Given a binary tree, find its maximum depth.

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

NOTE : The path has to end on a leaf node.

Example :

         1
        /
       2

max depth = 2.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Max Depth of Binary Tree on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Discussion

Click here to start solving coding interview questions

Free Mock Assessment

Fill up the details for personalised experience.

Phone Number *

OTP will be sent to this number for verification

+1 *

Phone Number

Graduation Year *

^*Enter the expected year of graduation if you're student

Current Employer

Company Name

College you graduated from

College/University Name

Job Title

By clicking on Start Test, I agree to be contacted by Scaler in the future.

Already have an account? Log in