本文共 566 字，大约阅读时间需要 1 分钟。

问题：

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 == NULL)            return 0;        return max((maxDepth(root->left)+1),(maxDepth(root->right)+1));       }};

转载地址：http://hztsi.baihongyu.com/