External sorting: Winner tree defeat tree

Sort is the outbound

The winner tree and the loser tree can find the most value in the log (n) time, but if you only find the most value, it is a little useless, and the number of records on the intermediate node is meaningless. The significance is that, after the value of any leaf node changes, the information of the intermediate node can still be used to quickly find the most value. It is often used in K-path Merge Sorting.

Therefore, after changing the value of a leaf node, the winner tree and the loser tree are reconstructed in different ways. The loser tree is only related to the records of the root node of the node, the winner tree is related to the brother node of the node. There is also a calculation to calculate its brother node. This is a waste, and nothing else.

(Puzzled)