(Test perfect binary tree)
A perfect binary tree is a complete binary tree with all levelsfully filled. Define a new class named BSTWithTestPerfect thatextends BST with the following methods:
(Hint: The number of nodes in a perfect binary tree is2^(height+1) - 1.)
/** Returns true if the tree is a perfect binary tree */ publicboolean isPerfectBST()
Class Name: Exercise25_03
