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

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

class Solution {
public:
    /**
     * 
     * @param root TreeNode类 
     * @return int整型
     */
    int maxDepth(TreeNode* root) {
        int lh,rh;
        if(root == nullptr){
            return 0;
        }
        else{
            lh = maxDepth(root->left);
            rh = maxDepth(root->right);
            return (lh>rh)?lh+1:rh+1;
        }
    }
};