A Bag Implementation That Links Data - Data Structures and Abstractions with Java - page 75

this (dataPortion, null );
} // end constructor

private Node(T dataPortion, Node nextNode)
{

data = dataPortion;
next = nextNode;
} // end constructor

private T getData()
{

return data;
} // end getData

private void setData(T newData)
{

data = newData;
} // end setData

private Node getNextNode()
{

return next;
} // end getNextNode

private void setNextNode(Node nextNode)
{

next = nextNode;
} // end setNextNode
} // end Node

3.26

With these additions to Node , we could revise the implementation of LinkedBag by making changes
such as the following:
•

Change
newNode.next = firstNode;

to

newNode.setNextNode(firstNode);

•

Change
currentNode = currentNode.next;

to

currentNode = currentNode.getNextNode();

•

Change
result = firstNode.data;

to

result = firstNode.getData();

•

Change
entryNode.data = firstNode.data;