Problem
1. Write a program that prints out all keys in a Patricia tree having the same initial t bits as a given search key.
2. For which of the radix methods is it reasonable to write a program which prints out the keys in sorted order? Which of the methods are not amenable to this operation?