Recursive search / T : O(N), S : O(1)


  • 0
    J
    public class Solution {
        public int maxDepth(TreeNode root) {
            if(root == null)
                return 0;
            
            int left = maxDepth(root.left);
            int right = maxDepth(root.right);
            return (left > right) ? left + 1 : right + 1;
        }
    }
    

Log in to reply
 

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