1.current = Root;

Short Answer

1.current = root;
2.while (current is not NULL or stack is nonempty)
if (current is not NULL)
{
visit current node;
push current onto stack;
current = current->lLink;
}
else
{
current = stack.top();
pop stack;
current = current->rLink; //move to the right child
}