[LeetCode-104]Maximum Depth of Binary Tree (java)
来源:互联网 发布:中国房价与收入比知乎 编辑:程序博客网 时间:2024/06/04 17:48
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.
题意:求一个二叉树的深度(即从根节点到最远叶子节点的距离)
分析:学过数据结构的小伙伴们,都知道这里要用DFS(深度优先遍历算法),我这里采用递归的方法实现。
- 如果只有根节点,则返回0;
- 排除这种特殊情况后,先递归求出左子树的深度l,在求出右子树的深度r;
- 则二叉树的深度即为max(l,r)+1。
代码部分比较简单,具体如下:
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public int maxDepth(TreeNode root) { if(root==null) return 0; else { //int l=maxDepth(root.left); //int r=maxDepth(root.right); //return l>r?l+1:r+1; return Math.max(maxDepth(root.left),maxDepth(root.right))+1; } }}
0 0
- [Leetcode] Maximum Depth of Binary Tree (Java)
- [LeetCode][Java] Maximum Depth of Binary Tree
- LeetCode|Maximum Depth of Binary Tree-java
- (java)leetcode Maximum Depth of Binary Tree
- leetcode:Maximum Depth of Binary Tree 【Java】
- Leetcode 104 Maximum Depth of Binary Tree
- LeetCode(104)Maximum Depth of Binary Tree
- LeetCode 104 Maximum Depth of Binary Tree
- LeetCode: Maximum Depth of Binary Tree [104]
- 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
- rw_《汇编语言》4
- Chris_C的技术世界扬帆起航
- hdu 5692 Snacks(dfs序+线段树)
- 拓扑排序
- [知识点滴]Div+CSS命名规范大全
- [LeetCode-104]Maximum Depth of Binary Tree (java)
- android ListView包含Checkbox滑动时状态改变
- Android AsyncTask源码分析
- [2] SDL的基础知识以及利用SDL播放视频
- Markdown编辑器使用帮助
- RabbitMQ开机自启动脚本
- [Leetcode] Missing Number
- rw_《数据结构》 9-10章 [内部排序和查找]
- 当margin用百分号(%)时,数值是以谁为基准?