StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
13092032
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2012-10-26T18:01:33.533
FavoriteCount
0
LastActivityDate
2012-10-26T18:07:57.230
LastEditDate
2012-10-26T18:07:57.230
LastEditorUserId
1729848
OwnerUserId
1729848
ParentId
12945941
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
Linked lists are templates allowing any type of variable to sit in them. In my honest opinion, you'd be best off using the <code>std::list</code> which requires the <code>#include <list></code> header file. Of course, if you really want the experience of writing a linked list class yourself then the following code makes a deep copy of a list: <pre><code>List::List( const List& other) { if( other.head_ != nullptr) { head_ = new Node( other.head_->item_); // copy first node assert( head_ != nullptr); // ensure that the memory was allocated correctly // copy the rest of the list Node* pnew = head_; // loop through the list until you reach the end (i.e. a node that's nullptr) for( Node* porig( other.head_->next_); porig != nullptr; porig = porig->next_) { // assign the next node in the destination list to the next node in the paramter's list pnew->next_ = new Node( porig->item_); assert( pnew->next_ != nullptr); // ensure that the memory was allocated correctly pnew = pnew->next_; // move onto the newly created node in the destination list } } else // if the parameter is empty then the destination list will be empty as well head_ = nullptr; } </code></pre> As for the destructor, you just need to run through the list deleting the nodes as you go: <pre><code>List::~List() { while( head_ != nullptr) { // keep looping until the list gets to the end // make a second pointer to the node you are about to delete (so you don't lose track of it) Node* pn( head_); // move the head_ onto the next node essentially "removing" the first node from your list head_ = head_->next_; // delete the node that you've just "removed" from your list delete pn; } } </code></pre> I've tried to make the comments clear up anything that might be unclear.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. PODeep copy and deconstructor sentinel linked list using Nodes
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USEdward
UserOwnerUserId
1. USEdward
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.