Given 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.
# Definition for a binary tree node
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# @param root, a tree node
# @return an integer
def minDepth(self, root):
if (root==None):
return 0
elif (root.left==None and root.right==None):
return 1 #和最深不一样,因为要保证最短的也是从叶子节点开始的
else:
minDepthLeft=self.minDepth(root.left);
minDepthRight=self.minDepth(root.right);
if minDepthLeft==0:<span style="font-family: 'Helvetica Neue', Helvetica, Arial, sans-serif;">#和最深不一样,因为要保证最短的也是从叶子节点开始的</span>
return minDepthRight+1
if minDepthRight==0:
return minDepthLeft+1
if (minDepthLeft>minDepthRight):
return minDepthRight+1
else:
return minDepthLeft+1