Write a test program that randomly generates 500,000 numbers and inserts them into a BST, reshuffles...

Question

Write a test program that randomly generates 500,000 numbers and inserts them into a BST, reshuffles the 500,000 numbers and performs a search,and reshuffles the numbers again before deleting them from the tree. Do the same thing using an AVL tree. Make sure to have the program compare the running times for completing all of these tasks for these two different trees.

Vaishnavi R · Accepted Answer

New folder (7)/ImplementingBST/.classpath
 
	 
		 
			 
		
	
	 
	 
New folder (7)/ImplementingBST/.project
 
	 ImplementingBST
	 
	 
	
	 
		 
			 org.eclipse.jdt.core.javabuilder
			 
			
		
	
	 
		 org.eclipse.jdt.core.javanature
	
New folder (7)/ImplementingBST/.settings/org.eclipse.jdt.core.prefs
eclipse.preferences.version=1
org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
org.eclipse.jdt.core.compiler.codegen.targetPlatform=15
org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
org.eclipse.jdt.core.compiler.compliance=15
org.eclipse.jdt.core.compiler.debug.lineNumber=generate
org.eclipse.jdt.core.compiler.debug.localVariable=generate
org.eclipse.jdt.core.compiler.debug.sourceFile=generate
org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
org.eclipse.jdt.core.compiler.problem.enablePreviewFeatures=disabled
org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
org.eclipse.jdt.core.compiler.problem.reportPreviewFeatures=warning
org.eclipse.jdt.core.compiler.release=enabled
org.eclipse.jdt.core.compiler.source=15
New folder (7)/ImplementingBST/bin/AVL.class
New folder (7)/ImplementingBST/bin/BST.class
New folder (7)/ImplementingBST/bin/Driver.class
New folder (7)/ImplementingBST/bin/Node.class
New folder (7)/ImplementingBST/src/AVL.java
New folder (7)/ImplementingBST/src/AVL.java
public class AVL {
    public Node rootNode;
    
    private int getHeight(Node node)
    {
        if (node == null)
            return 0;
        return node.height;
    }
    
    private Node rotateLeft(Node node)
    {
        Node n1 = node.right;
        Node n2 = n1.left;
        n1.left = node;
        node.right = n2;
        node.height = maxOf(getHeight(node.left), getHeight(node.right)) + 1;
        n1.height = maxOf(getHeight(n1.left), getHeight(n1.right)) + 1;
        return n1;
    }
    
    private Node rotateRight(Node node)
    {
        Node n1 = node.left;
        Node n2 = n1.right;
        n1.right = node;
        node.left = n2;
        node.height = maxOf(getHeight(node.left), getHeight(node.right)) + 1;
        n1.height = maxOf(getHeight(n1.left), getHeight(n1.right)) + 1;

Write a test program that randomly generates 500,000 numbers and inserts them into a BST, reshuffles the 500,000 numbers and performs a search,and reshuffles the numbers again before deleting them...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment