104. Maximum Depth of Binary Tree
104. Maximum Depth of Binary Tree
ShenduCC
发布于 2018-08-01 15:19:18
发布于 2018-08-01 15:19:18
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],
return its depth = 3.
很简单的二叉树题目，直接看代码就ok了。
int maxDepth(struct TreeNode* root) {
if(root==NULL) return 0;
if(root->left==NULL&&root->right==NULL)
return 1;
else if(root->left!=NULL&&root->right==NULL)
return maxDepth(root->left)+1;
else if(root->left==NULL&&root->right!=NULL)
return maxDepth(root->right)+1;
else
return _max(maxDepth(root->left)+1,maxDepth(root->right)+1);
}
int _max(int a,int b)
{
if(a>b)
return a;
else
return b;
}本文参与 腾讯云自媒体分享计划，分享自作者个人站点/博客。
原始发表：2018-06-18 ，如有侵权请联系 cloudcommunity@tencent.com 删除
评论
登录后参与评论
推荐阅读