StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
15456402
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2013-03-17T00:38:53.760
FavoriteCount
0
LastActivityDate
2013-03-17T01:01:51.890
LastEditDate
2013-03-17T01:01:51.890
LastEditorUserId
139985
OwnerUserId
139985
ParentId
15456153
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
You need to need to break down the function of (say) the <code>insert</code> method. <ul> <li>The new node will (typically) be inserted between two nodes ... except when you end up inserting at the start and end of the list.</li> <li>The local variable initialization sets things up so that we start looking at the beginning of the loop. The <code>prev</code> variable will point to the node before the insertion point. The <code>curr</code> variable will point to the node after the insertion point.</li> <li>The <code>while</code> loop finds the insertion point. It walks through the list nodes until it finds one that is greater than or equal <code>x</code>. The insertion point is before that node. If the list is empty (i.e. <code>head</code> is <code>null</code>), the insertion point is the start of the list. When it completes (including the case where it never runs), <code>prev</code> and <code>curr</code> will have the values needed for the final part ...</li> <li>The code after the while loop does the insertion, inserting the new node between the <code>prev</code> node and the <code>curr</code> node. If <code>prev</code> is <code>null</code>, it has to handle things differently.</li> </ul> <hr> So to answer your question: <blockquote> But which code makes curr not null then? </blockquote> No code does that. It does not need to be not null. At the point you are acttually doing the insertion, <code>curr</code> is the node after the insertion point. If you are inserting at the end of the list (or into an empty list), there is no node after the insertion point, and <code>curr</code> will (and should) be <code>null</code>. <hr> Insertion into singly linked lists is a little bit tricky to get your head around, but the key thing to remember is that any algorithm needs to find and update the node before the place you want to insert the new node. The same goes for deletion.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHow does insert and delete method of SortedList in Java work
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USStephen C
UserOwnerUserId
1. USStephen C
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. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. COYes it is hard to wrap my head around it. I will remember your key thing then: update before inserting the new node.
 singulars
 PostPostId
 PO
 UserUserId
 USNicholas

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.