剑指 Offer 55 - I. 二叉树的深度（递归）

解法：递归

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

int maxDepth(struct TreeNode* root){
    if(!root) return 0;
    int left = maxDepth(root->left);
    int right = maxDepth(root->right);
    return left>right ? ++left : ++right;
}