Simple java approach for maximum depth of binary tree.(100 faster).
LAKSHAY RAWAT
398
exploreRecursion I

class Solution {
public int maxDepth(TreeNode root) {

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

}

Comments (0)