leetcode-104-二叉树的最大深度
//递归，不用helper
/**
* 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) return 0;
else return max(maxDepth(root->left), maxDepth(root->right))+1;
}
};