Data structure and algorithms experimental subject 8.2 tree peace problem 9:28 experiment task I know the way many more trees of said method, son left right is a kind of representation brother younger brother. Now a tree in a given to left son son and brother younger brother table right of the tree, and with weights and "point, asks to give" for the root point of all the "point son tree of weights and. In a tree to the son left are right brother representation, according to the requirements of this tree output tree weights and the son. 9:28 data input The first behavior an integer n, 1 < = n < = 1000, said the tree "points, Numbers for 1 to n. Then there is n line, each row a node of the said information. For each line, the first integer b, said the Numbers of the node, the second integer m, said the node s weight, the third integer ls, said the node left son Numbers, 0 means no son left, the fourth integer rb, said the node right brother Numbers, 0 (no right broth

sum1.txt
sum2.txt
sum3.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．