How to print python binary tree from top to bottom

This article shows you how to print python binary tree from top to bottom, the content is concise and easy to understand, it will definitely brighten your eyes. I hope you can get something through the detailed introduction of this article.

Topic description

The binary tree is printed from top to bottom, and the nodes on the same layer print from left to right, and each layer prints to a line.

Total number of nodes list [list [int]]:

Res = []

If not root:

Return res

Q = [root]

While q:

# current layer length

Curlen = len (Q)

Curlevel = []

For node in q [: curlen]:

# add the node values of the current layer to the result in turn

Curlevel.append (node.val)

# append only non-empty child nodes

If node.left:

Q.append (node.left)

If node.right:

Q.append (node.right)

Res.append (curlevel)

# queue slice, start processing the next layer

Q = Q [curlen:]

Return res the above is how to print the python binary tree from top to bottom. Have you learned the knowledge or skills? If you want to learn more skills or enrich your knowledge reserve, you are welcome to follow the industry information channel.