Maximum Depth of Binary Tree

package tree.recursive;

import tree.TreeNode;

public class MaximumDepthOfBinaryTree {

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

}

package com.eureka
package tree.recursive

import tree.TreeNode

object MaximumDepthOfBinaryTree:

  def maxDepth(root: TreeNode): Int =
    if root == null then 0 else java.lang.Math.max(maxDepth(root.left), maxDepth(root.right)) + 1