Need Help with this Java Assignment Program should be done i

Need Help with this Java Assignment. Program should be done in JAVA please

Complete required scripts based on eclipse and troubleshoot the scripts until the tasks are done.

1. Implement a binary search tree (write the code for it), for a height of 2 or higher.

Solution

1.create node like

function Node(val)
{
this.value = val;
this.left = null;
this.right = null;
}

2.create constructor like
function BinarySearchTree()
{
this.root = null;
}
  
3.Inserting values
BinarySearchTree.prototype.push = function(val){
var root = this.root;

if(!root){
this.root = new Node(val);
return;
}

var currentNode = root;
var newNode = new Node(val);

while(currentNode){
if(val < currentNode.value){
if(!currentNode.left){
currentNode.left = newNode;
break;
}
else{
currentNode = currentNode.left;
}
}
else{
if(!currentNode.right){
currentNode.right = newNode;
break;
}
else{
currentNode = currentNode.right;
}
}
}

}
  

var bst = new BinarySearchTree();
bst.push(3);
bst.push(2);
bst.push(4);
bst.push(1);
bst.push(5);

DFS:
.....

unction dfs(node){
if(node){
console.log(node.value);
dfs(node.left);
dfs(node.right);
}
}

Traversal:
.............

function inorder(node){
if(node){
inorder(node.left);
console.log(node.value);
inorder(node.right);
}
}

min:
....
function minNode(node){
if(!node){
return 0;
}
if(node.left){
return minNode(node.left)
}
return node.value
}

max:
.....
function maxNode(node){
if(!node){
return 0;
}
if(node.right){
return maxNode(node.right)
}
return node.value;
}

BST
....
function isBST(node){
if(!node){
return true;
}

if(node.left != null && node.left.value > node.value){
return false;
}

if(node.right !=null && node.right.value < node.value) {
return false;
}

if(!isBST(node.left) || !isBST(node.right)) {
return false;
}

return true;
}
  

Height:
......
function height(node){
if(!node) return 0;
var leftHeight = height(node.left);
var rightHeight = height(node.right);

return Math.max(leftHeight, rightHeight) + 1;
}

ancestor:
........
function printAncestor(node, target){
if(!node) return false

if(node.value == target) return true;

if(printAncestor(node.left, target) || printAncestor(node.rigth, target)){
console.log(node.value);
return true;
}

return false
}

function commonAncestor(node, n1, n2){
if(!node) return;
var val = node.value;
if(n1 < val && n2<val){
return commonAncestor(node.left, n1, n2);
}
if(n1<val && n2<val){
return commonAncestor(node.right, n1, n2);
}
console.log(\'lowest common ancestor value: \', val);
return node;
}

function commonAncestorBT(node, n1, n2){
if(!node) return;
var val = node.value;
if(n1 == val || n2 ==val){
return node;
}
var left = commonAncestorBT(node.left, n1, n2);
var right = commonAncestorBT(node.right, n1, n2);
if(left && right){
return node;
}
return (left) ? left : right;
}