[LeetCode] Minimum Depth of Binary Tree

王朝学院·作者佚名  2016-05-27
窄屏简体版  字體: 小  |  中  |  大  |  超大  

[LeetCode] Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

这道题个人觉得其实思路和之前那个maximum depth的题思路差不多。那道题能做这道题也就没问题了。

代码如下。~

/** * 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 minDepth(TreeNode root) { if(root==null){ return 0; } int min=Integer.MAX_VALUE; Stack<TreeNode> tree=new Stack<TreeNode>(); Stack<Integer> value=new Stack<Integer>(); tree.push(root); value.push(1); while(!tree.isEmpty()){ TreeNode temp=tree.pop(); int val=value.pop(); if(temp.left==null&&temp.right==null){ min=Math.min(val,min); } if(temp.right!=null){ tree.push(temp.right); value.push(val+1); } if(temp.left!=null){ tree.push(temp.left); value.push(val+1); } } return min; }}

 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
 
© 2005- 王朝網路 版權所有 導航