
ADTs, Data Structures, and Problem Solving with C++ 2nd Edition by Larry Nyhoff
Edition 2ISBN: 978-0131409095
ADTs, Data Structures, and Problem Solving with C++ 2nd Edition by Larry Nyhoff
Edition 2ISBN: 978-0131409095 Exercise 1
Exercises 1-7 assume the following declarations (which are used to process singly-linked lists as described in this section):
?class Node { public: int data; Node * next; }; Node * p1, * p2, * p3;
Assume also that the following statements have been executed:
?p1 = new(nothrow) Node; p2 = new(nothrow) Node; p3 = new(nothrow) Node;
Tell what will be displayed by each of the code segments or explain why an error occurs.
?p1- data = 123; p2- data = 456; p1- next = p2; p2- next = 0; cout p1- data " " p1- next- data endl;
?class Node { public: int data; Node * next; }; Node * p1, * p2, * p3;
Assume also that the following statements have been executed:
?p1 = new(nothrow) Node; p2 = new(nothrow) Node; p3 = new(nothrow) Node;
Tell what will be displayed by each of the code segments or explain why an error occurs.
?p1- data = 123; p2- data = 456; p1- next = p2; p2- next = 0; cout p1- data " " p1- next- data endl;
Explanation
Analysis:
When the program statement is...
ADTs, Data Structures, and Problem Solving with C++ 2nd Edition by Larry Nyhoff
Why don’t you like this exercise?
Other Minimum 8 character and maximum 255 character
Character 255