Question

Have to write the tree into a text file?

JAVA CODE

Binary search tree

This is the tree

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;

}

}

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;

}

}

1 2 3 4 5 6 7 8 9 10 11 12 13 14 after rerrave: 1 3 4 5 6 7 8 9 10 11 12 13 14 public class Testost { public static void main(String[] args) { false cputine: 25632ns BinarySearchtree tree - new BinarysearchTreel); tree.callinsert(8); tree.callInsert(4); tree.callinsert(121; tree.callinsert(2); tree.callinsert(6): tree.callinsert(101; 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.callInOrder Recursive(); tree.callbelete(2); System.out.println("\nafter remove:"); tree.callInOrder Recursive(); long startTimeSystem.DanaTimel); System.out.println("\n"); System.out.print(tree.callSearch(15)); Long endTime=System.130 Tinell System.out.println("\n"; System.out.println("cputine:"+endTine-startTine)+"ns"); }

The text file should output just like what I got in the console.

Answer 1

//Java program

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;

}

}

class BinarySearchTree{
   private Buildbst root;
  
   public BinarySearchTree() {
       root = null;
   }
  
   private boolean search(Buildbst root, int key)
   {
        if (root==null)return false;
        if (root.getData()==key) return true;
  
        if (root.getData() > key)
            return search(root.getLeft(), key);
     
        return search(root.getRight(), key);
   }

   public boolean callSearch(int key) {
       return search(root , key);
   }
  
   private Buildbst insert(Buildbst root,int data) {
       if(root==null)return new Buildbst(data);
       if(root.getData() > data)
           root.setLeft( insert(root.getLeft(),data));
      
       if(root.getData() < data)
           root.setRight(insert(root.getRight(),data));
       return root;
   }
   public void callInsert( int key ){
       root = insert(root , key);
   }
  
   public void callInOrderRecursive() {
       inOrder(root);
      }

   private void inOrder(Buildbst root) {
       if(root == null) {
           return;
       }
       inOrder(root.getLeft());
       System.out.print(root.getData() + " ");
       inOrder(root.getRight());
   }
   private Buildbst delete(Buildbst root,int key) {  
       if(root==null)return root;
       else if(root.getData()< key)
           root.setRight(delete (root.getRight(),key));
       else if(root.getData() > key)
           root.setLeft(delete(root.getLeft(),key));
       else {
           if(root.getLeft()==null)
               return root.getRight();
           if(root.getRight()==null)
               return root.getLeft();
          
           Buildbst min=findmin(root.getRight());
           root.setData(min.getData());
           root.setRight( delete(root.getRight(),min.getData()));
          
       }
       return root;
      
   }
   private Buildbst findmin(Buildbst root) {
       while(root.getLeft()!=null)
           root=root.getLeft();
       return root;
   }

   public void callDelete( int key ){
       root = delete(root , key);
   }
}

public class Testbst{
   public static void main(String [] args){
       BinarySearchTree tree = new BinarySearchTree();
       tree.callInsert(8);
       tree.callInsert(4);
       tree.callInsert(12);
       tree.callInsert(8);
       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");
      
      
   }
}

//sample output

inorder: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 after remove 1 3 4 5 6 7 8 9 10 11 12 13 14 false cputime: 105506ns