$(15$ points$)$ In a sprawling urban landscape meticulously organized in a hierarchical structure of junctions and pathways, with each junction branching off into two distinct pathways, Navnoor, a notorious serial bomber, has detonated a bomb at a crucial junction. Pranav, the police detective, aims to stop Navnoor by mapping out the sequence of junctions affected by the blast. Return the sequence of junctions in the order in which the explosion will impact them.

The explosion will propagate steadily to connected junctions only. Each junction is impacted by the blast in equal time intervals. A junction is affected by the explosion only once.Target Node : $14$Input: $121310$ N N $1415$ N N N N $21242223($Level order input$)$Output :$1421,24,1015,1222,23,13$

First, the initial bomb explodes at node $14,$ affecting its immediate neighbours $(21,24,10).$ Following this initial detonation, the impact spreads to adjacent junctions sequentially. This process continues until the explosion has impacted all junctions.