题解 | #二叉树的最大深度#

/**
 * struct TreeNode {
 *  int val;
 *  struct TreeNode *left;
 *  struct TreeNode *right;
 * };
 */

class Solution {
  public:
    /**
     *
     * @param root TreeNode类
     * @return int整型
     */
    int maxDepth(TreeNode* root) {
        // write code here
        if(!root)   return 0;
        return max(maxDepth(root->left),maxDepth(root->right))+1;
    }

};