#97 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.

Have you met this question in a real interview? 

Yes

Example

Given a binary tree as follow:

  1 / \ 2   3   / \  4   5

The maximum depth is 3.

题目思路：

就不说了，简单的recursion。

Mycode（AC = 60ms）：

/** * Definition of TreeNode: * class TreeNode { * public: *     int val; *     TreeNode *left, *right; *     TreeNode(int val) { *         this->val = val; *         this->left = this->right = NULL; *     } * } */class Solution {public:    /**     * @param root: The root of binary tree.     * @return: An integer     */    int maxDepth(TreeNode *root) {        // write your code here        if (root == NULL) {            return 0;        }                return max(maxDepth(root->left), maxDepth(root->right)) + 1;    }};