eURd Edition ISBN 0-201-70297-5, Softcover, 816 pages, 2000 The Purpose of These

Question

eURd Edition ISBN 0-201-70297-5, Softcover, 816 pages, 2000 The Purpose of These Questions These are typical exam questions from Chapter 5 of the textbook·These eac, questions might not be on your exam, but if you rescarch and find the right answers to exam. (It's also possible that some of this material was not covered in your c questions and 16 multiple choice questions in this file. these questions, that should be good preparation for a real lass.) There are 29 short answer Short Answers The node definition: class node I TYPEDEF typedef double value_ type; / CONSTRUCTOR node( const value_types init data value_type(), node* init-link .NAL ( data field init data; 1ink field init link; ) Short Answers Sections 5.1-5.2 Linked List Fundamentals // Member functions to set the data and link fields: void set data(const value types new data) data field-new_data; 1 void set_link(node* new link) t link field new link; ) /I Constant member function to retrieve the current data: value type data() const f return data field;) /I Two s1ightly different menber functions to retreive /I the current link: const node link)const ( return link field; ) node* link() ( return link field; ) private: value_type data_field; node link field; 2: s the one statement that can be used to insert a new node at the head of a linked list. Assume that the list's head pointer is called head_ptr and the that the data for the new node is called entry. 2. Suppose that p is a pointer to a node in a linked list, and "p is not the tail node. What are the steps to removing the node after *p? Use one short English sentence for each step. htm

Explanation / Answer

(1) :node *new_node = new node; //Allocate Node
new_node->data_field = entry //Allocate data to node

new_node->next = head_ptr; //Make new_node->next point to head
head_ptr = newnode //Make head as new_node


(2) If *p is not the tail node, that means there are more node existing after that

=> p.next = p.next.next // this statement means the next Node of p will be linked to next to next node after p
In this way next node is removed after p


Thanks, let me know if there is any doubts/concern.

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.