设记录R[i]的关键字为R[i].KEY（1<=i<=k），树结点T[i]（1<=i<=K-1）指向败者记录，T[0]为全胜记录下标。写一算法产生对应上述R[i]（1<=i<= k）的败者树，要求除R[1..k]和T[0..k-1]以外，只用O(1)辅助空间。-Setting the recording R [i] is a keyword R [i] .KEY (1 < = i < = k), the tree node T [i] (1 < = i < = K-1) points loser record, T [0] is unbeaten record label. Corresponding to the above-described algorithm produces a write R [i] (1 < = i < = k) loser tree requires in addition R [1..k] and T [0..k-1] except using only O (1 ) auxiliary space.