Home/ Questions/Q 201841
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-11T17:14:05+00:00

I seem to be blind at the moment, so I need to ask here.

  • 0

I seem to be blind at the moment, so I need to ask here. I want to sort a list of tuples which look like that

(id, parent_id, value)

So that it is a representation of the tree as a flattend list of list of tree nodes.

For example the input

(1, None, '...')
(3, 2', '...')
(2, 1, '...')
(4, 1, '...')
(5, 2, '...')
(6, None, '...')

Should sorted like that afterwards

(1, None, '...')
(2, 1, '...')
(3, 2', '...')
(5, 2, '...')
(4, 1, '...')
(6, None, '...')

Any hint would be highly appreciated. Thanks in advance.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Python sorts tuples from left to right, so if you arrange your tuples so the first sort key is the first item and so forth, it’ll be reasonably efficient.

    The mapping from a list of tuples to a tree is not clear from what you’re describing. Please draw it out, or explain it more thoroughly. For example, your example appears to be:

    tree diagram
    (source: sabi.net)

    If you’ve got two nodes with no parent, that is more like a forest than a tree. What are you trying to represent with the tree? What does “sorted” mean in this context?

    • 0