Talk About Network



Register and Login
Nick
Password
Register create new account Sign up is FREE and you can post replies, new topics, bookmark posts and more!
Recover lost password


Programming > C++ > Linked List - ...
Latest [ Topics | Posts ] Archive Post A New Topic Post a Reply
<< Topic < Post Post 1 of 5 Topic 45742 of 45898
Post > Topic >>

Linked List - M-Choice Question

by yogi_bear_79 <yogi_bear_79@[EMAIL PROTECTED] > May 3, 2008 at 08:58 AM

Assume a linked list of nodes which have an info data member and a
next data member.  Suppose a pointer called cursor points to a node in
the middle of the linked list.  To move ptr to the next node use:


ptr=next;
next->ptr;
ptr->next;
ptr=ptr->next;
none of the above.

I want to anwser none of the above as i feel it should be cursor-
>next;  But I could also anwser ptr->next; if I disregard the info
leading up to last sentacne which is the actual question (To move ptr
to the next node use:).  is this a trick question, or am i reading to
much into it?




 5 Posts in Topic:
Linked List - M-Choice Question
yogi_bear_79 <yogi_bea  2008-05-03 08:58:16 
Re: Linked List - M-Choice Question
"osmium" <r1  2008-05-03 09:43:28 
Re: Linked List - M-Choice Question
=?UTF-8?B?RXJpayBXaWtzdHL  2008-05-03 16:59:03 
Re: Linked List - M-Choice Question
Daniel Pitts <newsgrou  2008-05-03 10:14:20 
Re: Linked List - M-Choice Question
yogi_bear_79 <yogi_bea  2008-05-03 10:33:49 

Post A Reply:
  Go here to Signup

AddThis Feed Button


About - Advertising - Contact - Frequently Asked Questions - Privacy Policy - Terms of Use - Signup

Contact
tan12V112 Wed May 14 17:11:38 CDT 2008.