(Solved) : Bstjava Generic Binary Search Tree Import Javautil Public Class Bst Implements Iterable Pr Q28205921 . . . .

/************************ BST.java*************************** generic binary search tree*/import java.util.*;
public class BST<T extends Comparable<T>>implements Iterable<T> {protected BSTNode<T> root = null;
public BST() {}public BST(BSTNode<T> p) {root = p;}
public void clear() {root = null;}
public boolean isEmpty() {return root == null;}
protected void visit(BSTNode<T> p) {System.out.print(p.key + ” “);}
public T search(T el) {return search(el, root);}//recursive searchprotected T search(T el, BSTNode<T> p) {if (p == null)return null;else if(el.compareTo(p.key ) < 0)return search(el, p.left);else if(el.compareTo(p.key) > 0)return search(el, p.right );elsereturn p.key;}/*//Iterative searchpublic T search(T el) {BSTNode<T> p = root;while (p != null) {if (el.equals(p.key))return p.key;else if (el.compareTo(p.key) < 0)p = p.left;else p = p.right;}return null;}*/public boolean isInTree(T el) {return