Question

Problemi: Create a new Java Application that has the following methods: 1. A method that generate a binary search tree (BST) where the number of nodes and the range of the values are from a file 2. A recursive method to print the BST in preorder traversal 3. A recursive method to print the BST in post-order traversal 4. A recursive method to print the BST in in-order traversal 5. A method to find the largest value in a BST 6. A method to find and return the smallest value in a BST 7. A method to search for a given value V in a BST 8. A recursive method to count the number of all nodes in BST 9. A method to count the number of leaf nodes in BST 10. A method to count the number of nodes that contain even numbers in a BST 11. A method to count the number of nodes with 2 children (child may be a single node or a sub-tree) 12. A method to check if two BSTs are identical or not 13. A method to print the BST in breadth first (Hint : you need a queue to implement this method) Write the main method to test these methods described in 1 to 13 Problem 2 Write the following classes: Class Entry that has two members: word (String) and meaning (ArrayList of Strings). Write the initialization constructor, setters, getters, and toString method. Class Dictionary that has a BST of Entry objects. Read al entries from a file (word and meaning) and insert them into the BST as Entry objects. Provide the following menur 1. Display all entries in the dictionary in Alphabetical order 2. Add a word to the dictionany 3. Search for a word in the dictionary. If found, all meanings are displayed 4. Display the first word in the dictionary in Alphabetical order 5. Display the last word in the dictionary in Alphabetical order 6. Return how many words in the dictionary 7. Exit Use the following data as your input file: Dictionary: a tool which defines words and may provide information about their pronunciation, history, and usage Biography: account of someones life written by another person Tone: attitude of words Recompense: reward; payment Caprices: whims Adulterations: impurities; added ingredients that are improper or inferior Propagators: those who cause something to happen or spread Risible: prompting laughter Abasement: condition of being put down or humbled Credulity: tendency ti believe to readily Malignity: strong desire to harm others Pernicious: causing serious injury; deadly Inculcated: impressed upon the mind by repetition Anthology: A collection of flowers; a collection of poems Club: An assembly of god fellows, meeting under certain conditions Imagination: Fancy; the power of forming ideal pictures; the power of representing things absent to one's self or others; Conecption; image in the mind idea Contrivance; scheme Kind: Benevolent; filled with general good-will Pastern: The knee of a horse Patron: One who countenances, supports, or protects. Commonly a wretch who supports with insolence and is paid with flattery Pension: An allowance made to anyone without an equivalent. In England it is generally understood to mean pay given to a state hireling for treason to his country

Answer 1

import java.util.Scanner;
import java.io.*;
class BinaryTree {

int data;
BinaryTree left;
BinaryTree right;

static int count=0;
public BinaryTree(int num) {
this.data = num;
this.left = null;
this.right = null;
}

public void addNode(int num) {
if (num < this.data) {
if (this.left != null) {
this.left.addNode(num);
} else {
this.left = new BinaryTree(num);
}

} else {
if (this.right != null) {
this.right.addNode(num);
} else {
this.right = new BinaryTree(num);
}

}
}

public void traversePreOrder() {
System.out.print( this.data + " ");
if( this.left != null ) {
this.left.traversePreOrder();
}
if( this.right != null ) {
this.right.traversePreOrder();
}
}

public void traverseInOrder() {
if( this.left != null ) {
this.left.traverseInOrder();
}
System.out.print( this.data + " ");
if( this.right != null ) {
this.right.traverseInOrder();
}
}

public void traversePostOrder() {
if( this.left != null ) {
this.left.traversePostOrder();
}
if( this.right != null ) {
this.right.traversePostOrder();
}
System.out.print( this.data + " ");
}

public void largestValue() {

if(null == this) {
System.out.println("Tree is empty");
return;
}
//we found the max value
if(this.right == null)
System.out.println("Largest element is: " +this.data);
else
this.right.largestValue();

}

public int smallestValue() {

if(null == this) {
System.out.println("Tree is empty");
return Integer.MIN_VALUE;
}
//we found the max value
if(this.left == null)
return this.data;
else
return this.left.smallestValue();

}

void find(int value){
if(this.data == value) {
System.out.println("value found");
return;
}
  
else if(value < this.data){
if(this.left==null){
   System.out.println("value not found");
   return;
   }
   else
this.left.find(value);
}
else{
   if(this.right==null){
   System.out.println("value not found");
   return;
   }
   else
    this.right.find(value);
}
}

public int countNodes() {

if( null == this ) {
System.out.println("bye");
return 0;
}
else
return 1 + this.left.countNodes( ) + this.right.countNodes( );

}

public static void main(String ar[]) throws Exception{
Scanner sc=new Scanner(new File("data.txt"));
int j=0;

BinaryTree tree = new BinaryTree( sc.nextInt() );
int[] nums=new int[100];
while(sc.hasNext()){
nums[j++]=sc.nextInt();
}
//int[] nums = {15, 200, 25, -5, 0, 100, 20, 12, 126, 1000, -150};
for(int i : nums ) {
tree.addNode( i );
}
System.out.println("\nPreorder Traversal");
tree.traversePreOrder();
System.out.println("\nInorder Traversal");
tree.traverseInOrder();
System.out.println("\nPostorder Traversal");
tree.traversePostOrder();

System.out.println("");
tree.largestValue();

int min=tree.smallestValue();
System.out.println("Smallest element is: " +min);

tree.find(201);

int total=tree.countNodes();
System.out.println("total Nodes are: "+total);
}

}

-----------------------

contents of the file are

11
15
200
25
-5
0
100
20
12
126
1000
-150

where first element is the size and rest are the elements.