Minimum Depth of Binary Tree
2016-05-26 18:16
267 查看
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
import java.lang.Math;
public class Solution {
public int minDepth(TreeNode root) {
if(root == null) {
return 0;
}
if(root.left != null && root.right != null) {
return Math.min(minDepth(root.left),minDepth(root.right)) + 1;
} else {
return Math.max(minDepth(root.left),minDepth(root.right)) + 1;
}
}
}
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
import java.lang.Math;
public class Solution {
public int minDepth(TreeNode root) {
if(root == null) {
return 0;
}
if(root.left != null && root.right != null) {
return Math.min(minDepth(root.left),minDepth(root.right)) + 1;
} else {
return Math.max(minDepth(root.left),minDepth(root.right)) + 1;
}
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解