[Leetcode] Minimum Depth of Binary Tree, minimum distance to leaf node (python)

Source: Internet
Author: User

Given a binary tree, find its minimum depth.

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

classSolution:#@param root, a tree node    #@return An integerMINDEP =-1defmindepth (self, root):ifRoot isNone:return0 self.helper (Root,1)        returnSELF.MINDEP#@param DEP, currently the first level    defHelper (SELF,ROOT,DEP):ifRoot.left isNone andRoot.right isNone:ifSelf.mindep is-1: SELF.MINDEP=DEPelifSELF.MINDEP >Dep:self.minDep=DEPifDEP >= SELF.MINDEP andSelf.mindep is  not-1:            returnFalseifRoot.left is  notNone:self.helper (ROOT.LEFT,DEP+1)                    ifRoot.right is  notNone:self.helper (ROOT.RIGHT,DEP+1)

I'm using DFS, but I've set up a MINDEP global variable. This variable stores the smallest "leaf node-to-root distance", so when other branches traverse, check if DEP (current distance) is greater than MINDEP, and if it is greater than or equal, the traversal of the branch ends .

[Leetcode] Minimum Depth of Binary Tree, minimum distance to leaf node (python)

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.