Straight Linked List Implementation

• void Node::Push( Node * newNode)

• {

• Node * temp;

• temp=itsNext;

• itsNext=newNode;

• newNode->SetNext(temp);

• HowManyNodes++;

• return;

• }

Previous slide

Next slide

Back to first slide

View graphic version