Leetcode:minimum Depth of Binary Tree "Python Edition"

1, the recursive call in the class to add self;

2, Root is None, return 0

3, Root is not about none,root child for none, return 1

4. Return the L and r minimum depths, and L and R are initially maximum values;

1 #Definition for a binary tree node2 #class TreeNode:3 #def __init__ (self, x):4 #self.val = x5 #self.left = None6 #self.right = None7 8 classSolution:9     #@param root, a tree nodeTen     #@return An integer One     defmindepth (self, root): A         ifRoot = =None: -             return0 -         ifRoot.left==none androot.right==None: the             return1 -L,r = 9999,9999 -         ifroot.left!=None: -L =self.mindepth (root.left) +         ifroot.right!=None: -R =self.mindepth (root.right) +         ifl<r: A             return1 +L at         return1+r

Leetcode:minimum Depth of Binary Tree "Python Edition"