list, map and put of the Queue in the Tree Data Structure

[DeaD_EyE]

This is a fancy way calling fringe.put for each element of tree_struct.

list(map(fringe.put, tree_struct))

This could be written as:

for element in tree_struct:
    fringe.put(element)

The try to explain this:

from queue import Queue


result_queue = Queue()
values = (1, 2, 3, 4, 5, 6)


print(list(map(result_queue.put, values)))
# will do:
#   result_queue.put(1)
#   result_queue.put(2)
#   result_queue.put(3)
#   ...
#
# But the result is:
# [None, None, None, None, None, None]
# result_queue.put does return None
# and not the element you've put into the queue

print(f"Now {result_queue.qsize()} elements are in result_queue")
# the elements are in the Queue

print("\nElements in Queue:")
# loop until result_queue is empty
while not result_queue.empty():
    print(result_queue.get())