Suppose that you want to simulate the life cycle of a binary search tree as described on slides 45-48 of the trees lecture slides (cis 256 and cis 279 class notes)preview the document and in section 4.3.5. (average-case analysis) of the textbook by mark allen weisspreview the document. considering the problems that can be caused by random insert/remove pairs, here is a strategy that is not perfectly random, but close enough: initial setup: build a tree with n elements by inserting n elements chosen at random from the range 1 to m , where m is an integral multiple of n, i. e. m = k*n (where k is an integer independent of n).