A perfect binary tree is a complete binary tree withall levels fully filled. Add a method in the BST class to return true if the tree isa perfect binary tree. (Hint: The number of nodes in a nonempty perfect binarytree is 2height - 1)/** Returns true if the tree is a perfect binary tree */boolean isPerfectBST()

Java / Trees: *Please refer to attached image* What is the inorder of this tree? Multiple chocie. G X C A N V F Q L W G X C A N V F L W E A C V N X G F L W E A C V N VG F L W E

Write a method isBST() that takes a Node as argument and returns true if the argument node is the root of a binary search tree, false otherwise.Hint : This task is also more difficult than it might seem, because the order in which youcall the methods in the previous three exercises is important

Don't skip

In java: binary tree Write a method called findTotalParents (, this method will find all the nodes that considered to be parents with any dependency and return the total number of parents. The public method shall not take any parameters, but the private method takes a BNode as a parameter, representing the current root.