Maximum Depth of Binary Tree

Problem

Given a binary tree, find the maximum depth of the tree.
Example input:
    1
   / \
  2   3
     / \
    4   5
Example output:
3

Solution

This solution is in C#. Our A.I. can create solutions in multiple languages.

kayakane

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace InterviewQuestions.LeetCode
{
    class MaximumDepthOfBinaryTree
    {
        /// <summary>
        /// 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.
        /// </summary>
        /// <param name="root"></param>
        /// <returns></returns>
        public static int MaxDepth(TreeNode root)
        {
            if (root == null)
            {
                return 0;
            }

            int leftDepth = MaxDepth(root.left);
            int rightDepth = MaxDepth(root.right);

            return Math.Max(leftDepth, rightDepth) + 1;
        }
    }
}