Answered step by step
Verified Expert Solution
Question
1 Approved Answer
public class Node implements Comparable { private String keyword; private List references; // TODO: given some keyword, and mode (1 = arraylist 2 = sorted
public class Node implements Comparable { private String keyword; private Listreferences; // TODO: given some keyword, and mode (1 = arraylist 2 = sorted arraylist) set up the Node public Node(String keyword, int mode){ this.keyword = keyword; if (mode == 1) { references = new ArrayList<>(); } else if (mode == 2) { //references = new sortedArrayList<>(); } } public String getKeyword(){ return this.keyword; } public List getReferences(){ return this.references; } public void insertReference(String website){ this.references.add(website); } // TODO: Compare some other Node to this Node, String compareTo is your bestfriend here; return -1 if the other object of comparison isn't a Node public int compareTo(Object o){ return -1; } // TODO: similar to compareTo except in boolean format and is only concerned if the other Node has the same keyword or not public boolean equals (Object o) { if (o instanceof Node) { Node other = (Node) o; return this.keyword.equals(other.keyword); } else return false; } public String toString(){ return this.keyword + " " + this.references; } }
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started