Give the contents of the file after each of
the three passes of LSD radix sort (straight radix sort)
for the file of 3-bit binary numbers
Draw the binary tree that results when the keys A N O T H E R T R E E
are inserted into an initially empty tree, first using the standard
algorithm, then using the root insertion method.
Extra Credit.
Give a sequence of ten keys (use the letters A through
J) that, when inserted into an initially empty tree using the root
insertion method, requires a maximal number of comparisons to build
the tree (and give the number of comparisons used).