Course: Data Structure and AlgorithimsLanguage: JavaKindly make the program in 2 hours.Task is well explained. You have to make the proogram properly in Java and attach output screen with program:Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk:classBSTNode {Node left;Node right;int data;publicBSTNode(int _data);// assign data to_data and assign left and right node to null}class BST{ BSTNoderoot; public BST();// assign root to nullvoid insert(int data);// this function insert the data in tree which maintain property of BSTboolean Search(int key); this function search the data in bst and return true if key is found else return falsepublic void EvenPrint(Node n)// this function only print the data which are even, make this function resursivepublic void OddPrint(Node n)// this function only print the data which are odd, make this function resursivepublic void PrimePrint(Node n)// this function only print the data which are Prime, make this function resursive

import java.util.*;import java.lang.*;import java.io.*; class BSTNode{ BSTNode left; BSTNode…

Answered: Course: Data Structure and Algorithims…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Course: Data Structure and Algorithims

Language: Java

Kindly make the program in 2 hours.

Task is well explained.

You have to make the proogram properly in Java and attach output screen with program:

Restriction: Prototype cannot be change you have to make program by using given prototype.

TAsk:

classBSTNode

{

Node left;

Node right;

int data;

publicBSTNode(int _data);// assign data to_data and assign left and right node to null

}

class BST

{

BSTNoderoot;

public BST();// assign root to null

void insert(int data);// this function insert the data in tree which maintain property of BST
boolean Search(int key); this function search the data in bst and return true if key is found else return false
public void EvenPrint(Node n)// this function only print the data which are even, make this function resursive
public void OddPrint(Node n)// this function only print the data which are odd, make this function resursive
public void PrimePrint(Node n)// this function only print the data which are Prime, make this function resursive

Expert Solution

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions