Question

public class Buildbst {

private int data;

private Buildbst left;

private Buildbst right;

//Set the binary search tree

public Buildbst(int data) {

this.data = data;

this.left = null;

this.right =null;

}

public int getData() {

return data;

}

public void setData(int data) {

this.data = data;

}

public Buildbst getLeft() {

return left;

}

public void setLeft(Buildbst left) {

this.left = left;

}

public Buildbst getRight() {

return right;

}

public void setRight(Buildbst right) {

this.right = right;

}

}

package Assignment5;

public class BinarySearchTree {

private Buildbst root;

public BinarySearchTree() {

this.root = null;

}

//Search

Buildbst search(Buildbst root, int data) {

if (root == null)

return null;

if (data < root.getData())

return search(root.getLeft(),data);

else if (data > root.getData())

return search(root.getRight(),data);

else

return root;

}

Buildbst insert(Buildbst root, int data) {

if (root == null)

root = new Buildbst(data);

else {

if (data < root.getData())

root.setLeft(insert(root.getLeft(),data));

else if (data > root.getData())

root.setRight(insert(root.getRight(),data));

}

return root;

}

//To find the smallest root

Buildbst findMin(Buildbst root) {

if (root == null)

return null;

else if (root.getLeft() == null)

return root;

else

return findMin(root.getLeft());

}

//delete the root that the user want

Buildbst delete(Buildbst root, int data) {

Buildbst temp;

if (root == null)

System.out.println("isempty");

else if (data < root.getData())

root.setLeft(delete(root.getLeft(),data));

else if (data > root.getData())

root.setRight(delete(root.getRight(),data));

else {

if (root.getLeft() != null && root.getRight() != null) {

temp = findMin(root.getRight());

root.setData(temp.getData());

root.setRight(delete(root.getRight(),root.getData()));

}else {

temp = root;

if (root.getLeft() == null)

root = root.getRight();

else if (root.getRight() == null)

root = root.getLeft();

temp = null;

}

}

return root;

}

  

void InOrderRecursive(Buildbst root) {

if(root == null)

return;

InOrderRecursive(root.getLeft());

System.out.print(root.getData() + " ");

InOrderRecursive(root.getRight());

}

//return a boolean number

public boolean callSearch(int data) {

root = search(root, data);

if (root != null) {

return true;

}

else {

return false;

}

}

  

public void callInsert(int data) {

root = insert(root, data);

}

public void callDelete(int data) {

root = delete(root, data);

}

public void callInOrderRecursive() {

InOrderRecursive(root);

}}

package Assignment5;

public class Testbst {

public static void main(String[] args) {

  

BinarySearchTree tree = new BinarySearchTree();

tree.callInsert(8);

tree.callInsert(4);

tree.callInsert(12);

tree.callInsert(2);

tree.callInsert(6);

tree.callInsert(10);

tree.callInsert(14);

tree.callInsert(1);

tree.callInsert(3);

tree.callInsert(5);

tree.callInsert(7);

tree.callInsert(9);

tree.callInsert(11);

tree.callInsert(13);

tree.callInsert(1);

System.out.println("inorder：\n");

tree.callInOrderRecursive();

tree.callDelete(2);

System.out.println("\nafter remove:");

tree.callInOrderRecursive();

long startTime=System.nanoTime();

System.out.println("\n");

System.out.print(tree.callSearch(15));

long endTime=System.nanoTime();

System.out.println("\n");

System.out.println("cputime:"+(endTime-startTime)+"ns");

}

}

}

How to write the result into a txt file?

Answer 1

Answer:

Just place the below code at the under of the main function.

This works perfectly and it has no error.

Code:

try {
   long diff=endTime-startTime;

   String result="CPU TIME : "+Long.toString(diff);
FileWriter myWriter = new FileWriter("C:\\Users\\Public\\result.txt");
myWriter.write(result);
myWriter.close();
  
}
  
   catch (IOException e) {
System.out.println("An error occurred.");
e.printStackTrace();
}