题目链接:
https://leetcode.cn/problems/maximum-depth-of-binary-tree/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode* root) {
//叶子结点深度为0
if (root == nullptr)return 0;
//两子树都存在则返回深度更大的子树深度
if (root->left && root->right)return max(maxDepth(root->left), maxDepth(root->right)) + 1;
//只有左子树
else if (root->left) return maxDepth(root->left) + 1;
//只有右子树
else return maxDepth(root->right) + 1;
}
};