How to understand the balanced binary tree in python

In this issue, the editor will bring you how to understand the balanced binary tree in python. The article is rich in content and analyzes and narrates it from a professional point of view. I hope you can get something after reading this article.

Topic description

Enter the root node of a binary tree to determine whether the tree is a balanced binary tree. If the depth difference between the left and right subtrees of any node in a binary tree is less than 1, then it is a balanced binary tree.

1 bool:

# Recursive, judge while finding the depth, return the depth, and whether the global variable marks whether it is currently balanced.

Balance = True

Def getDepth (node):

Nonlocal balance

If not node or not balance:

# Recursive exit: if the node is empty or unbalanced, return 0, there is no need to continue recursion

Return 0

Ldepth = getDepth (node.left)

Rdepth = getDepth (node.right)

If abs (ldepth-rdepth) > 1:

# unbalanced, the global variable is set to false

Balance = False

# return the depth of the current node itself

Return max (ldepth, rdepth) + 1

GetDepth (root)

Return balance

This is how to understand the balanced binary tree in python shared by the editor. If you happen to have similar doubts, you might as well refer to the above analysis to understand. If you want to know more about it, you are welcome to follow the industry information channel.