DATA STRUCTURES & ALGORITHMS COURSE:Java programming languageAttached zip has project description...

Question

DATA STRUCTURES & ALGORITHMS COURSE:Java programming languageAttached zip has project description and other files needed for the completion of the project.

Arun Shankar · Accepted Answer

Project2/.DS_Store
__MACOSX/Project2/._.DS_Store
Project2/.classpath
 
	 
		 
			 
		
	
	 
	 
Project2/.project
 
	 Project2
	 
	 
	
	 
		 
			 org.eclipse.jdt.core.javabuilder
			 
			
		
	
	 
		 org.eclipse.jdt.core.javanature
	
Project2/bin/BST.class
Project2/bin/SearchAnalysis.class
Project2/bin/AVL.class
Project2/bin/Node.class
Project2/.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=14
org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
org.eclipse.jdt.core.compiler.compliance=14
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=14
Project2/src/Node.java
Project2/src/Node.java
// package searchanalysis;
// data structure that represents a node in the tree
class Node
{
    int data; // holds the key
    Node parent; // pointer to the parent
    Node left; // pointer to left child
    Node right; // pointer to right child
    int bf; // balance factor of the node
    public Node(int d)
    {
        data = d;
        parent = null;
        left = null;
        right = null;
    }
}
__MACOSX/Project2/src/._Node.java
Project2/src/AVL.java
Project2/src/AVL.java
// package searchanalysis;
//AVL Binary search tree implementation in Java
//Main Source: AlgorithmTutor
public class AVL {
    private Node root;
    public AVL() {
        root = null;
    }
    private Node searchTreeHelper(Node node, int key) {
        if (node == null || key == node.data) {
            return node;
        }
        if (key  1) {
            rebalance(node);
            return;
        }
        if (node.parent != null) {
            if (node == node.parent.left) {
                node.parent.bf -= 1;

DATA STRUCTURES & ALGORITHMS COURSE:Java programming languageAttached zip has project description and other files needed for the completion of the project.

Answer To: DATA STRUCTURES & ALGORITHMS COURSE:Java programming languageAttached zip has project description...

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment