Talk:Sorting algorithms/Tree sort on a linked list

Revision as of 03:08, 4 April 2014 by rosettacode>Spoon! (Created page with "I don't understand this task. Tree sort traditionally means loading the elements into a (new) binary search tree data structure, and then reading the elements back out. I don'...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

I don't understand this task. Tree sort traditionally means loading the elements into a (new) binary search tree data structure, and then reading the elements back out. I don't understand what it means to "tree sort them inplace" in a linked list. --Spoon! (talk) 03:08, 4 April 2014 (UTC)

Retrieved from "https://rosettacode.org/wiki/Talk:Sorting_algorithms/Tree_sort_on_a_linked_list?oldid=245614"

Return to "Sorting algorithms/Tree sort on a linked list" page.