Maximum Depth of Binary Tree

最新推荐文章于 2020-12-01 23:52:02 发布

Nereus_Li

最新推荐文章于 2020-12-01 23:52:02 发布

阅读量479

点赞数

分类专栏： LeetCode 文章标签：二叉树

本文链接：https://blog.csdn.net/li_chihang/article/details/44749943

版权

LeetCode 专栏收录该内容

113 篇文章 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.

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

int maxDepth(TreeNode *root) {
	if (root == NULL)
		return 0;
	int leftdepth  = maxDepth(root->left);
	int rightdepth = maxDepth(root->right);
	return max(leftdepth, rightdepth) + 1;
}