Exam 13: Pointers and Linked Lists

In the following search function for a linked list using the Node and NodePtr as defined in the text), why is there code to check if here is NULL? NodePtr searchNodePtr head, int target) { NodePtr here = head; Ifhere == NULL) { Return NULL; } Else { While here->data != target && here->link != NULL) { Here = here->link; } Ifhere->data == target) { Return here; } Else { Return NULL; } } }

Most applications that use a stack will store a struct or class object on the stack.

*head.item is the same as *head).item

A _______ is a list constructed using pointers.

The last node in a linked list as defined in the text should always point back to the head of the list.

The stack can be compared to a line of people at a bank, where the first person in line is the first person served.

The first node in a linked list is generally named _________

Data is removed at the back of the queue.

In a linked list as defined in the text, the pointer in the last node in the list should always point to _________.

The function used to put data into a stack is typically called _______.

A linked list is not fixed in size.

The arrow operator ->) combines the actions of which two operators?

If you need to access the last element of a linked list with N nodes in it, how many comparisons do you need to make to find the last element?

You can directly access the nth node of a linked list

A stack exhibits ______________ behavior

A _________ is a struct or class object that has one or more member variables that are pointer variables.

The stack exhibits last-in/first-out behavior

A stack can be implemented using a __________.

What is wrong with the following definition of headInsert? Struct Node { Int item; Node* link; }; Typedef Node* NodePtr; Void headInsertNodePtr& head, int data) { NodePtr tmp = new Node; Tmp->item = data; Head->next = tmp; Tmp->next = head->next; } NodePtr head; HeadInserthead, 4);

If you need to insert an element in the front of a list with N nodes and move the other elements back one place), how many nodes do you have to move?