LeetCode 104. Maximum Depth of Binary Tree
来源:互联网 发布:帝国时代3mac三合一 编辑:程序博客网 时间:2024/06/11 01:50
题目:
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.
思路:
使用递归求解非常容易,一个节点的深度等于它的左子树的深度和它的右子树的深度的最大值加上1,空树的深度是0.
代码:
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: int maxDepth(TreeNode* root) { if (NULL == root){ return 0; } int l = maxDepth(root->left); int r = maxDepth(root->right); return l > r ? l + 1:r+1; }};
0 0
- [LeetCode]104.Maximum Depth of Binary Tree
- 【LeetCode】104.Maximum Depth of Binary Tree
- [Leetcode] 104. Maximum Depth of Binary Tree
- LeetCode --- 104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- leetCode 104. Maximum Depth of Binary Tree
- 104. Maximum Depth of Binary Tree LeetCode
- 104. Maximum Depth of Binary Tree LeetCode
- LeetCode 104. Maximum Depth of Binary Tree
- leetcode:104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- [LeetCode]104. Maximum Depth of Binary Tree
- leetcode 104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- 【LeetCode】104. Maximum Depth of Binary Tree
- LeetCode#104. Maximum Depth of Binary Tree
- Leetcode 104. Maximum Depth of Binary Tree
- LeetCode *** 104. Maximum Depth of Binary Tree
- maven多模块项目SpringMVC简单实例
- strlen,strcpy,strcat,strstr,strcmp,strchr函数的使用和注意事项
- 【设计模式】 建造者模式(Builder Pattern)- 最易懂的设计模式解析
- hadoop的dw-hive安装配置---hadoop安装系列之三
- 页面跳转与重定向总结
- LeetCode 104. Maximum Depth of Binary Tree
- 【设计模式】 外观模式(Facade Pattern)
- C#WebApi通过Get方法存Json到数据库
- N
- LeetCode 141. Linked List Cycle
- hihoCoder 1496 寻找最大值
- android-用户界面[相对布局] 三
- vue-router
- 蓝桥杯模拟题一套,资料复制下面网址查看,以下是解析 1.2.3