leetcode 104 Maximum Depth of Binary Tree（难易度：Easy）

zhutianyu_123

于 2015-08-29 12:01:36 发布

阅读量365

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/zhutianyu_123/article/details/48086363

版权

leetcode 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

Maximum Depth of Binary Tree

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.

代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int maxDepth(struct TreeNode* root) {
    if(root == NULL)
		return 0;
	int left = maxDepth(root->left);
	int right = maxDepth(root->right);
	return (left > right) ? left+1 : right+1;
}

原题地址： https://leetcode.com/problems/maximum-depth-of-binary-tree/