Recursion-based One Liner


  • 0
    O
    class Solution {
    public:
        int maxDepth(TreeNode* root) {
            return root ? (1 + max(maxDepth(root->left), maxDepth(root->right))) : 0;
        }
    };
    

Log in to reply
 

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