Shulou(Shulou.com)06/02 Report--

This article introduces the knowledge of "how to use Python recursion to find the depth of binary tree". In the operation of actual cases, many people will encounter such a dilemma, so let the editor lead you to learn how to deal with these situations. I hope you can read it carefully and be able to achieve something!

In fact, it is to find the binary tree level, for example, a single point is one layer, and a single point plus two leaf nodes is two layers.

In fact, the binary tree problem is faster to find truth by recursion. This is also the default recursive method introduced, that is, if there are child nodes, recursion until there are no child nodes.

# Definition for a binary tree node.# class TreeNode:# def _ init__ (self, x): # self.val = x # self.left = None# self.right = Noneclass Solution: def maxDepth (self Root: TreeNode)-> int: if root = = None: return 0 else: leftDepth = self.maxDepth (root.left) rightDepth = self.maxDepth (root.right) return max (leftDepth,rightDepth) + 1 "how to find the binary tree depth with recursion" ends here Thank you for your reading. If you want to know more about the industry, you can follow the website, the editor will output more high-quality practical articles for you!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.