2020-03-20
1.题目描述
求二叉树的深度
2.题解
用递归求解即可,注意终止条件,因为对这个题目比较熟悉,就直接在里面写的代码
3.代码
#include <iostream>
using namespace std;
// 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 leftlen = maxDepth(root->left);
int rightlen = maxDepth(root->right);
return max(leftlen,rightlen)+1;
}
};
int main(){
Solution s;
return 0;
}