LeetCode(104)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.

题目分析:

简单题。求树的最大深度。递归求解。

class Solution {public:    int maxDepth(TreeNode *root) {        if(root==NULL)            return 0;        else{            int l=maxDepth(root->left);            int r=maxDepth(root->right);            return 1+(l>r?l:r);        }    }};