*****USING ECLIPSE Please don't just repost previous posts.

For this exercise, you should create a random binary sort tree with 1023 nodes. The items in the tree can be real numbers, and you can create the tree by generating 1023 random real numbers and inserting them into the tree, using the usual treeInsert() method for binary sort trees. Once you have the tree, you should compute and output the average depth of all the leaves in the tree and the maximum depth of all the leaves. To do this, you will need three recursive subroutines: one to count the leaves, one to find the sum of the depths of all the leaves, and one to find the maximum depth. The latter two subroutines should have an int-valued parameter, depth, that tells how deep in the tree you've gone. When you call this routine from the main program, the depth parameter is 0; when you call the routine recursively, the parameter increases by 1. Build your solution on code and principles from section 9.4.2. Previous: Learning Journal AssignmentExit book Skip Table of contents Table of contents Overview Introduction Reading Assignment Discussion Forum question Assignment Learning Journal Assignment Exercises