Maximum Depth of Binary Tree

Title: Maximum Depth of Binary Tree Source: leetcode.com

Given a binary tree, find its maximum depth.

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

Python solution

''' https://leetcode.com/problems/maximum-depth-of-binary-tree/ '''

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if not root:
            return 0
        
        if not root.left and not root.right:
            return 1
            
        l = 1 + self.maxDepth(root.left)
        r = 1 + self.maxDepth(root.right)
        
        if l > r:
            return l
        else:
            return r

''' https://leetcode.com/problems/maximum-depth-of-binary-tree/ '''

# Definition for a binary tree node.

# class TreeNode(object):

# def __init__(self, x):

# self.val = x

# self.left = None

# self.right = None

class Solution(object):

def maxDepth(self, root):

"""

:type root: TreeNode

:rtype: int

"""

if not root:

return 0

if not root.left and not root.right:

return 1

l = 1 + self.maxDepth(root.left)

r = 1 + self.maxDepth(root.right)

if l > r:

return l

else:

return r

Rate this post

Coddicted

Maximum Depth of Binary Tree

Python solution

Leave a Reply Cancel Reply