Write a private method in binarysearch called passedtest. this method accepts a binarynode and determines if the difference of height of the right subtree and left subtree is greater than 1. if it is greater than 1, it should return false and otherwise it should return true.

Acomputer has a two-level cache. suppose that 60% of the memory references hit on the first level cache, 35% hit on the second level, and 5% miss. the access times are 5 nsec, 15 nsec, and 60 nsec, respectively, where the times for the level 2 cache and memory start counting at the moment it is known that they are needed (e.g., a level 2 cache access does not even start until the level 1 cache miss occurs). what is the average access time?