Sectuon 11.2: Build draw binary search tree with the names Doc, Grumpy, Happy, Sleepy, a Bashful, Sneezy, Dopey, inserted in the order provided here. Assume that, on future searche of this tree, each name is equally likely to be searched for and there is a 0.1 probability that name will be searched for which is not in the tree. What is the average number of name comparisons that will occur during a search?
Section 11.3 List the names from your tree above in infix, prefix, and postfix orders.