面试题55 - I. 二叉树的深度

O(n)

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

int max(int a,int b){
    return a>b?a:b;
}
int maxDepth(struct TreeNode* root){
    if(root==NULL){
        return 0;
    }
    if(root->left==NULL&&root->right==NULL){
        return 1;
    }
    return max(maxDepth(root->left),maxDepth(root->right))+1;
}