104. Maximum Depth of Binary Tree

Dear 丶 2022-06-10 14:10 271阅读 0赞

/*

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.
60%
*/
/***
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
int maxDepth(struct TreeNode* root) {
int i,j;
if(root==NULL)
return 0;
i = maxDepth(root->left);
j = maxDepth(root->right);
return i>j?i+1:j+1;
}

发表评论

表情：
评论列表 （有 0 条评论，271人围观）

还没有评论，来说两句吧...

相关阅读