Maximum Depth of Binary Tree
来源:互联网 发布:乌鲁木齐打车软件 编辑:程序博客网 时间:2024/06/05 14:47
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 binary tree
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
解析:
给你一个二叉树,返回他的最大深度。只有跟节点的深度为1,没有root的是0
依次类推。最大深度为从根节点到最远的一个叶子的深度。
典型的dfs。只需要一个全局的depth变量,用来记录递归的深度;、
<pre name="code" class="java">int MaxDepth=0;public int maxDepth(TreeNode root) {if(root==null) return 0;dfs(root,0);return MaxDepth;}//depth是调用者的深度。如root节点调用dfs,则depth为1;public void dfs(TreeNode node,int depth){if(node==null) return;depth++;if(node.left==null&&node.right==null){if(MaxDepth<depth) MaxDepth=depth;}dfs(node.left,depth);dfs(node.right,depth);}
0 0
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- c++ STL binary_search() demo
- Mysql char varchar效率
- TCP编程
- LINUX 分区
- 转基因食品将毁了下一代 Brown film faced plywood
- Maximum Depth of Binary Tree
- Java处理带BOM头的文件小结
- 软件项目需求开发过程实践之软件需求说明书
- mysql数据库优化方法
- 使用Native WLAN API查找无线网络
- cocos2d-x之CREATE_FUNC宏
- Android 仿Win8的metro的UI界面
- kafka插件在logstash上的安装
- CodeForces 148E Porcelain dp+背包(水