题目链接:https://leetcode.com/problems/maximum-depth-of-binary-tree/
题面:
104. Maximum Depth of Binary Tree
Easy
135254FavoriteShare
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.
Note: A leaf is a node with no children.
Example:
Given binary tree [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
return its depth = 3.
题意:求树深。
代码:
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==NULL)return 0;
int depth;
depth=max(maxDepth(root->left),maxDepth(root->right))+1;
return depth;
}
};