Without using recursion .. implementation of BST with java codes ....how to solve those all functions

Question

import java.util.*;

public class Solution<Key extends Comparable<Key>, Value> {
private Node root; // root of BST

private class Node {
private Key key; // sorted by key
private Value val; // associated data
private Node left, right; // left and right subtrees
private int size; // number of nodes in subtree

public Node(Key key, Value val, int size) {
this.key = key;
this.val = val;
this.size = size;
}
}

/**
* Initializes an empty symbol table.
*/
public Solution() {
}

/**
* Returns true if this symbol table is empty.
* @return {@code true} if this symbol table is empty; {@code false} otherwise
*/
public boolean isEmpty() {

}

/**
* Returns the number of key-value pairs in this symbol table.
* @return the number of key-value pairs in this symbol table
*/
public int size() {

Answer 1

Your code is incomplete. Please save it in code playground and attach here.

Please write out and explain BST

Answer 2

Okay ..will try it brother