CodeEasy v0.1

Maximum Depth of Binary Tree

Easy Subject: Trees
Time Complexity
O(N)
Space Complexity
O(H)

Problem Description

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.

Optimal Solution

Python 
def maxDepth(root):
    if not root:
        return 0
    return 1 + max(maxDepth(root.left), maxDepth(root.right))