Simple one line Solution in Java


  • 0
    S

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

    }
    

    }


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.