Talk:Sorting algorithms/Tree sort on a linked list: Difference between revisions

Line 7:
:: Ah, I knew there was a reason this had appeared on my radar (ignore the Phix entry for now, I'll replace it). I propose replacing the "Test case" paragraph with
Task:
First, construct a doubly linked list (unsorted).
Then construct a tree in situ: use the prev and next of that list as left and right tree pointers.
Then traverse the tree, in order, and recreate a doubly linked list, again in situ, but of course now in sorted order.
7,806

edits