Write a size method for a linked list implementation of a queue that does not have a count member.

What will be an ideal response?

```
public int size()
{
int count; // number of nodes
if (head == null)
count = 0;
else
{
count = 1;
LinearNode temp = head; // for traversal
while(temp.getNext() != null)
{
count++;
temp = temp.getNext(); // go to next node
} // end while
} // end else
return count;
} // end method size
```