made _Node and main method

README.md

@@ -44,13 +44,13 @@ It should feel quite similar to code you would have seen in your first-year CS c
 In a small group (around 4 students), choose one of you to make a fork of
 https://github.com/CSC207-2023F-UofT/multiset-adt 
 
-- [ ] Each other team member should make a fork of that repo (or the repository owner can add the others
+- [X] Each other team member should make a fork of that repo (or the repository owner can add the others
   as collaborators).
 
-- [ ] Take the time to skim the rest of the instructions to get a better sense of what you'll be doing
+- [X] Take the time to skim the rest of the instructions to get a better sense of what you'll be doing
   in this activity. If you have any immediate questions, raise these with your group or ask your TA.
 
-- [ ] As a team, explore the python code base and identify specific pieces of code that will need to
+- [X] As a team, explore the python code base and identify specific pieces of code that will need to
   be completed. (See the general strategies and advice further below, ask other groups, or
   ask your TA for advice as needed.)
     - The next section highlights a few aspects of the code which your team should think about as you

src/Tree.java

@@ -1,2 +1,6 @@
+// matthew test
+
 public class Tree {
 }
+
+

src/_Node.java

@@ -0,0 +1,10 @@
+public class _Node {
+    Object item;
+    _Node next;
+
+    public _Node(Object item){
+        this.item = item;
+        this.next = null;
+    }
+
+}

src/main.java

@@ -0,0 +1,28 @@
+import java.util.ArrayList;
+import java.util.Random;
+public class main {
+    public static void main(String[] args) {
+
+
+    }
+
+    public void profileMultiSet(MultiSet my_input, int n){
+        ArrayList<Integer> items_added = new ArrayList<Integer>();
+        Random rand = new Random();
+        for (int i = 0; i<n; i++){
+            int x = rand.nextInt(101);
+            my_input.add(x);
+            items_added.add(x);
+        }
+        assert my_input.size == n;
+        long start = System.currentTimeMillis();
+        for (int x: items_added){
+            items_added.remove(x);
+        }
+        long end = System.currentTimeMillis();
+
+        assert items_added.isEmpty();
+        System.out.println("too lazy for now, will fix later" + "time: " + (start - end));
+
+    }
+}