aaa

multiset-adt.iml

@@ -0,0 +1,12 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/test" isTestSource="true" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

src/ArrayList.java

@@ -0,0 +1,2 @@
+package PACKAGE_NAME;public class ArrayList {
+}

src/LinkedListMultiSet.java

@@ -0,0 +1,37 @@
+public class LinkedListMultiSet<T> implements MultiSet<T> {
+    /**
+     * Unlike the TreeMultiList, this implementation does not just "wrap" an
+     * underlying tree, it is instead a custom LinkedList implementation, which
+     * only provides the necessary MultiSet methods.
+     *
+     * Representation Invariant:
+     * front is null represents an empty MultiSet
+     */
+
+    private Node<T> front;
+    private int size;
+
+    public LinkedListMultiSet() {
+        front = null;
+        size = 0;
+    }
+
+    // You would need to implement the MultiSet interface methods here
+    // For example:
+    @Override
+    public void add(T item) {
+        // Implement the add method
+    }
+
+    @Override
+    public int count(T item) {
+        // Implement the count method
+        return 0;
+    }
+
+    @Override
+    public void remove(T item) {
+        // Implement the remove method
+    }
+
+

src/MultisetADT.java

@@ -0,0 +1,9 @@
+public interface MultisetADT {
+    public boolean add(Object item);
+    public void remove(Object item);
+    public boolean contains(Object item);
+    public boolean is_empty();
+    public int count(Object item);
+    public int size();
+
+}

src/Node.java

@@ -0,0 +1,9 @@
+public class Node<T> {
+    public T item;
+    public Node<T> next;
+
+    public Node(T item) {
+        this.item = item;
+        this.next = null;
+    }
+}

src/Tree.java

@@ -1,2 +1,48 @@
-public class Tree {
-}
+import java.util.ArrayList;
+
+public class Tree implements MultisetADT {
+    private int root;
+    private ArrayList<Tree> subtrees;
+
+    public Tree(int root, ArrayList<Tree> subtrees) {
+        this.root = root;
+
+        if (subtrees.isEmpty()) {
+            this.subtrees = null;
+        }
+        else {
+            this.subtrees = subtrees;
+        }
+    }
+
+
+    @Override
+    public boolean add(Object item) {
+        return false;
+    }
+
+    @Override
+    public void remove(Object item) {
+
+    }
+
+    @Override
+    public boolean contains(Object item) {
+        return false;
+    }
+
+    @Override
+    public boolean is_empty() {
+        return false;
+    }
+
+    @Override
+    public int count(Object item) {
+        return 0;
+    }
+
+    @Override
+    public int size() {
+        return 0;
+    }
+}