How to use cartoons to analyze python binary trees

This article introduces how to use cartoons to analyze the python binary tree, the content is very detailed, interested friends can refer to, I hope it can be helpful to you.

Tips: a binary tree is a connected acyclic graph, and the maximum degree of each node is 2, that is, there are several direct sub-nodes.

Tips: bf: the depth of the left subtree of the node minus the depth of the right subtree. Let's talk about depth and height here.

For a tree, the height and depth are the same, the depth is accumulated from the root node, and the height is on the contrary, high.

Degrees are accumulated from the bottom up of the leaf node, so the height and depth are not necessarily the same for a single node.

The existing array 35, 28, 16, 4, 4, 56, 78, and 12, 96, 21, to construct a sorted binary tree.

35 is the first element and becomes the root node.

2856, to the right of 56.

122, to the right of 2.

4 > 3, to the right of 3.

5 > 4, to the right of 4.

On how to use cartoons to analyze the python binary tree to share here, I hope the above content can be of some help to you, can learn more knowledge. If you think the article is good, you can share it for more people to see.