Technique #3:
Use a Tree instead of Linear List
Use a Tree instead of Linear List
lFor the
same amount of data, a sufficiently balanced tree uses only O(log n) to traverse a chain
rather than O(n) (as in na•ve bubble, selection, or insertion sort).
lHeapsort is a form of sorting that uses trees.
lHeapsort is a form of sorting that uses trees.