Java simple solution using recursion

  • 0

    Just recurse to both left and right leaves and them return the max of depths.

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

Log in to reply

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