Consider the code below. Assume head points to the beginning of a list and is a

class variable:

public void methodA$($Node newNode$)\{$

if $($head $==$ null$)$

head $=$ newNode;

else $\{$

newNode $.$ next $=$ head;

head $=$ newNode;

$\}$

$\}$

public void methodB$($Node newNode$)\{$

Node iter $=$ head;

if $($head $==$ null$)$

head $=$ newNode;

else $\{$

while$($iter$.$next $$ null$)$

iter $=$ iter $.$next;

Iter $.$ next $=$ newNode;

$\}$

$\}$

Suppose the list already has five elements. What code would be faster in terms

of adding an element to the list?

Method A because you don't have to traverse through the list.

Both are the same because they both add a node to a linked list.

Method B because it safely adds a new node to the list using an iterator node.

Method B because it checks null before spending time to do anything else.

Method A because it has fewer lines of code.