Whereas various efficient learning algorithms have been recently proposed to perform bipartite ranking tasks, cast as receiver operating characteristic (ROC) curve optimisation, no method fully tailored to K-partite ranking when K >= 3 has been documented in the statistical learning literature yet. The goal is to optimise the ROC manifold, or summary criteria such as its volume, the gold standard for assessing performance in K-partite ranking. It is the main purpose of this paper to describe at length an efficient approach to recursive maximisation of the ROC surface, extending the TreeRank methodology originally tailored for the bipartite situation (i.e. when K=2). The main barrier arises from the fact that, in contrast to the bipartite case, the volume under the ROC surface criterion of any scoring rule taking K >= 3 values cannot be interpreted as a cost-sensitive misclassification error and no method is readily available to perform the recursive optimisation stage. The learning algorithm we propose, called TreeRank Tournament (referred to as 'TRT' in the tables), breaks it and builds recursively an ordered partition of the feature space. It defines a piecewise scoring function whose ROC manifold can be remarkably interpreted as a statistical version of an adaptive piecewise linear approximant of the optimal ROC manifold. Rate bounds in sup norm describing the generalisation ability of the scoring rule thus built are established and numerical results illustrating the performance of the TRT approach, compared to that of natural competitors such as aggregation methods, are also displayed.