Chapter 18, Problem 1E

Explanation of Solution

:

//define a method

public void addAll(HashIntSet other) {

    //loop initialized to verify the value of "front"

    for (Node front : other.elementData) {

        //assign the value

        Node current = front;

        //loop executed till the value of "current" is not equal to null

        while (current != null) {

            //add the value

            add(current.data);

            //assign the value

            current = current.next;

        }

    }

}

Explanation:

• Define the method “addAll()”,
  • “for” loop is executed to check the value stored in the node named as “front”.
    • The current node named as “current” stores the value stored in the node “front”.
    • “while” loop is executed till the value stored in the node “current” is not equal to “zero”.
      • Add the value to the hash set with the use of the “add()” method.
      • Now the value of next node is assigned to the “current” node.