/**
knakul853
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(!root)return 0;

        int l = max(maxDepth(root->left),maxDepth(root->right))+1;
        return l;
    }
};