the tracks will be added and the output of the play function should print out the tracks being played in the same order in which we queued themmedia_player add_track(track media_player add_track(track media_player add_track(track media_player add_track(track media_player add_track(track media_player play(the output of the preceding code is as follows>>now playing white whistle >>now playing butter butter >>now playing oh black star >>now playing watch that chicken >>now playing don' go upon execution of the programit can be seen that the tracks are played in the order in which they were queued when playing the trackthe system also pauses for the number of seconds equal to that of the length of the track summary in this we used our knowledge of linking nodes together to create other data structuresnamely stacks and queues we have seen how these data structures closely mimic stacks and queues in the real world concrete implementationstogether with their varying typeshave been shown we later applied the concept of stacks and queues to write real-life programs we shall consider trees in the next the major operations on tree will be discussedlikewise the different spheres in which to apply the data structure