104. 二叉树的最大深度

最新推荐文章于 2024-02-27 19:33:11 发布

心向暖

最新推荐文章于 2024-02-27 19:33:11 发布

阅读量103

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/fadbgfnbxb/article/details/95730414

版权

leetcode 专栏收录该内容

96 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <algorithm>
#include "string"
#include "vector"
#include "stack"
#include "set"
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;
	return 1+max(maxDepth(root->left), maxDepth(root->right));
}
int main()
{
	    TreeNode t1 = TreeNode(3);
		TreeNode t2 = TreeNode(9);
		TreeNode t3 = TreeNode(20);
		TreeNode t4 = TreeNode(15);
		TreeNode t5 = TreeNode(7);
		t1.left = &t2; t1.right = &t3;
		t3.left = &t4; t3.right = &t5;
		
		cout << maxDepth(&t1);
	
	
	system("pause");
	return 0;
}