* establish the tree with the following principles: * 1. the father of each number is the first larger number on its left and the smaller one on its right, the first one larger than it * 2. if a number is infinite on the left, it's not on the right. That is to say, this number is the maximum in the entire number * * / How / / as soon as possible to find out each one on both sides of the first larger number? Using stack Find / left, from left to right through each number, keep the descending order of the stack, the new data kept by the pop from the top of the stack, the stack until the new number or number ratio Find / right, from right to left traverse each number, keep the descending order of the stack, the new data kept by the pop from the top of the stack, the stack until the new number or number ratio

java_code
java_code\MaxTree.java

• 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．