104-Maximum-Depth-of-Binary-Tree.cpp

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;
    }
};