leetcode：Maximum Depth of Binary Tree（计算二叉树深度） 【面试算法】

题目：

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

查找二叉树的深度，递归去做，注意判断边界就好了。

/**
 * Definition for binary tree
 * 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)return 0;
        return max(maxDepth(root->left),maxDepth(root->right))+1;
        
    }
};