1. Add a function to the BinarySearchTree class that counts the number of edges in a tree.
2. Rewrite Exercise 1 so that it stores the words from a text file. Display all the words in the file and the number of times they occur in the file.
Exercise 1
Write a program that generates 10,000 random integers in the range of 0-9 and stores them in a binary search tree. Using one of the algorithms discussed in this chapter, display a list of each of the integers and the number of times each appears in the tree.