// interface method ==================================================public boolean isFullBT() {/*See BST.java for method specification *//* Hint: How can you "break-up" the problem into smaller...

// interface method ==================================================
public boolean isFullBT() {
/*See BST.java for method specification */
/* Hint: How can you "break-up" the problem into smaller pieces? */
/* Your code here */


return false; // Dummy return statement. Remove when you implement!
}

IN JAVA LANGUAGE

RETURN TRUE IF BST IS A COMPLETE BST

RETURN FALSE IS BST IS NOT A COMPLETE BST

ALL INFO IN PICTURES

PLS AND THANK YOU!!!!!

Extracted text: public class BSTIMP1 implements BST { private Node root; private int size; public BSTImpl() { root = null; size = 0; public BSTImpl(int val) { this.root - new NodeImpl(val); size = 1;


Extracted text: public boolean isFullBT(); /* Returns true if the tree is a full binary tree. A full binary * tree is defined as a binary tree where each node either has * 2 children or e children. * This method should call upon the recursive helper isFullTree_r() which you write. @return true if the tree is full, false otherwise Example: The tree below is full. (5) (2) (7) (1) (3) Example: The tree below is NOT ful1. (8) (3) (18) (2)