Maximum Depth of Binary Tree

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.

Subscribe to see which companies asked this question

public class Solution {    public static int maxDepth(TreeNode root) {        if(root==null)        return 0;        int rightDepth = maxDepth(root.right);        int leftDepth = maxDepth(root.left);        if(rightDepth>leftDepth)        return ++rightDepth;        return ++leftDepth;    }}