Skip to content
Programming101
Programmingoneonone

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programmingoneonone

Learn everything about programming

Leetcode Maximum Depth of Binary Tree problem solution

YASH PAL, 31 July 2024

In this Leetcode Maximum Depth of Binary Tree problem solution we have 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.

Leetcode Maximum Depth of Binary Tree problem solution

Topics we are covering

Toggle
  • Problem solution in Python.
  • Problem solution in Java.
  • Problem solution in C++.
  • Problem solution in C.

Problem solution in Python.

class Solution(object):
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        
        return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right)) if root else 0

Problem solution in Java.

public int maxDepth(TreeNode root) {
     return find(root);   
    }
    
    public int find(TreeNode root) {
        if(root == null) {
            return 0;
        }
        return Math.max(find(root.left),find(root.right))+1;
    }

Problem solution in C++.

int maxDepth(TreeNode* root) {
        return depth(root, 1);
    }
    int depth(TreeNode* node, int d)
    {
        if(node==NULL)
            return 0;
        return max(d,max(depth(node->left,d+1),depth(node->right,d+1)));
    }

Problem solution in C.

int maxDepth(struct TreeNode* root){
    int Depth = 0;

    void inorder(struct TreeNode ** root, int depth) {
        depth++;
        if (root[0]) {
            inorder(&root[0]->left, depth);
            if (depth > Depth) { Depth = depth; }
            inorder(&root[0]->right, depth);
        }
    }
    
    if (root)
        inorder(&root, 0);
    
    return Depth;
}

coding problems solutions

Post navigation

Previous post
Next post
  • Automating Image Format Conversion with Python: A Complete Guide
  • HackerRank Separate the Numbers solution
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
How to download udemy paid courses for free

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes