In this paper we discuss how to present the result of searching elements of any type from XML documents relevant to some information need (relevance-oriented search). As the resulting elements can contain each other we show an intuitive way of organizing the resulting list of elements in several ranked lists at different levels such that each element is presented only one time. Depending on the size of such ranked lists its presentation is given by a structure tree for small lists or by a sequence of pointers for large lists. In both cases the textual content of the implied elements is given. We also analyse the size of ranked lists in a real collection of XML documents.