Praveen falls from a tall tree

Praveen has climbed a tall tree and now he can't get down! While he is waiting for Arjun to bring a ladder, he has decided to amuse himself by numbering the **N** nodes of the tree from **1** to **N** and associating a value **S[i]** with every vertex. For that, he applies the following procedure: ``` val = 1 Let T be our tree. while T is not empty: - Identify the branching nodes of tree T.