Maximum Depth of Binary Tree
2015-03-06 23:48
239 查看
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变量,用来记录递归的深度;、
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); }
相关文章推荐
- Maximum Depth of Binary Tree
- leecode Maximum Depth of Binary Tree
- 迭代----- Maximum Depth of Binary Tree
- [LeetCode]Maximum Depth of Binary Tree
- LeetCodeOJ. Maximum Depth of Binary Tree
- LeetCode:Minimum Depth of Binary Tree&& Maximum Depth of Binary Tree
- leetcode_oj_Maximum Depth of Binary Tree
- LeetCode:Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree
- 【LeetCode】Maximum Depth of Binary Tree
- 【LeetCode-面试算法经典-Java实现】【104-Maximum Depth of Binary Tree(二叉树的最大深度)】
- 【二叉树的递归】02二叉树的最大深度【Maximum Depth of Binary Tree】
- Maximum Depth of Binary Tree
- [leetcode]Maximum Depth of Binary Tree
- Maximum Depth of binary tree
- [LeetCode] Maximum Depth of Binary Tree
- LeetCode Maximum Depth of Binary Tree
- [LeetCode] Maximum Depth of Binary Tree
- 【Leetcode】Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree