QuestionQuestion

Design and implement a series of experiments that compare the relative performance for the SSet implementations:
SkiplistSSet
ScapegoatTree
Treap
RedBlackTree.
2-4 tree <if you have completed this>

Be sure to include multiple test scenarios, including cases where the data is random, already sorted, is removed in random order, is removed in sorted order, and so on.

Solution PreviewSolution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

public class TwoFourTree extends StringSSet implements LevelOrderTraversal {

    /* your class MUST have a zero argument constructor. All testing will
   use this ocnstructor to create a 2-3 tree.
    */
    private MyNode root;
    private int counter;

    public TwoFourTree() {
       // add whatever code you want.
       root = new MyNode();
       counter = 0;
    }

    @Override
    public int size() {
       return counter;
    }

   
    @Override
    public String find(String x) {
       MyNode curr = root;
       int num;
       while (true) {
            num = curr.find(x);
            // // // System.out.println(Arrays.toString(curr.myData) + " " + curr.myData.length);

            if (num >= 0) {
                return curr.getData(num);
            } else if (curr.isLeaf()) {
                if (x.compareTo(curr.myData[0]) < 0) {
                   return curr.myData[0];
                }
                if (x.compareTo(curr.myData[curr.myDataNum - 1]) > 0) {
                   MyNode p = curr.myParent;                  
                   while (p != null) {                        
                        for (int i = 0; i < p.myDataNum; i++) {
                            if (p.myData[i].compareTo(x) > 0) {
                               return p.myData[i];
                            }
                        }
                        p = p.myParent;
                   }
                   return null;
                }
               
                for (int i = 0; i < curr.myDataNum; i++) {
                   if (curr.myData[i].compareTo(x) > 0) {
                        return curr.myData[i];
                   }
                }
               
                break;
            }
            curr = getNextChild(curr, x);
       }
       return null;
    }...

By purchasing this solution you'll be able to access the following files:
Solution.zip.

$72.00
for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

Find A Tutor

View available Java Programming Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Decision:
Upload a file
Continue without uploading

SUBMIT YOUR HOMEWORK
We couldn't find that subject.
Please select the best match from the list below.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Live Chats