leetcode#104：Maximum Depth of Binary Tree

int maxDepth(TreeNode* root) {        if(root == NULL)                return 0;        int maxL = maxDepth(root->left);        int maxR = maxDepth(root->right);        return maxL > maxR ? maxL + 1 : maxR + 1;