Nested Set Model Sorting

yo, on this page What are the options for storing hierarchical data in a relational database? there is an awesome comparison of options for storing hierarchies. For me it looks lik

Solution 1:

In the nested set model, the tree structure is implied by the order in which the nodes are traversed.

If you want a sort order different from that for which the tree was created, you have to read the results first, and then sort them manually in a second step. (After rows have been read from a table, indexes are no longer useful.)