Simplest C++ One-Liner Solution


  • 0
    M
    class Solution {
    public:
        int maxDepth(TreeNode* root) {
            return !root ? 0 : 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.