leecode第一百零四题（二叉树的最大深度）

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(root==NULL)
            return 0;
        
        int m=maxDepth(root->left);
        int n=maxDepth(root->right);
        int max_num=max(m,n);
        
        return max_num+1;
    }
};