1)  What's the time complexity of the following member functions in
    the KTree ADT? 
    a) find
    b) remove
    c) insert

    How does the degree to which a tree is well-balanced influence 
    these?

2)  Consider the tradeoffs between an array-based implementation for
    k-ary trees and the pointer-based implementation used in this
    assignments. 

    a) What parts would have been easier to implement with a static 
		implementation? How?
    b) Discuss space wastage, assuming a maximum number of children m
		and an average number of children M, for trees with
		N nodes.


3)  Propose another interesting use for treemaps in understanding a
	large quantity of data (something other than file storage or
	courses taught).