算法分析与设计作业题
作业来源
/**
* 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==NULL){
return 0;
}
int leftTree=maxDepth(root->left);
int rightTree=maxDepth(root->right);
return max(leftTree,rightTree)+1;
}
};