StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
19634419
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
2
CommunityOwnedDate
CreationDate
2013-10-28T12:08:37.583
FavoriteCount
0
LastActivityDate
2013-10-28T15:19:47.973
LastEditDate
2013-10-28T15:19:47.973
LastEditorUserId
2927610
OwnerUserId
2927610
ParentId
19633808
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
What about this approach: Traverse the tree in preorder (visiting each node). For each node (when travelled to it) check if it has a left child. If so (indicating a node with child elements in original tree) print the nodes data with a ':' and take its subtree and follow all right sons (which are representing all siblings) recursively, afterwards print each right sons data (you have it in reversed order. In Code: <pre><code>void print_siblings() { if (this->right != NULL) { this->right->print_siblings(); } cout << data << ", "; } void traverse(void) { if (this->left != NULL) { cout << data << ":"; this->left->print_siblings(); cout << endl; this->left->traverse(); } if (this->right != NULL) { this->right->traverse(); } } </code></pre> Edit: Here is a inorder-traversal: <pre><code>void traverse_inorder(void) { if (this->left != NULL) { this->left->traverse_inorder(); cout << data << ":"; this->left->print_siblings(); cout << endl; } if (this->right != NULL) { this->right->traverse_inorder(); } } </code></pre> Output for preorder would be: <pre><code>1:5, 4, 3, 2, 3:7, 6, 5:8, 8:11, 10, 9, </code></pre> Output for inorder would be: <pre><code>3:7, 6, 8:11, 10, 9, 5:8, 1:5, 4, 3, 2, </code></pre> Edit2: Just for completeness, the post-order traversal as well :-) <pre><code>void traverse_postorder(void) { if (this->left != NULL) { this->left->traverse_postorder(); } if (this->right != NULL) { this->right->traverse_postorder(); } if (this->left != NULL) { cout << data << ":"; this->left->print_siblings(); cout << endl; } } </code></pre> And its output: <pre><code>8:11, 10, 9, 5:8, 3:7, 6, 1:5, 4, 3, 2, </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POBinary tree and especial node printing
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USuser2927610
UserOwnerUserId
1. USuser2927610
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. COwouldn't this print tree in order, but with reversed childs?
 singulars
 PostPostId
 PO
 UserUserId
 USwaplet
2. CONo actually it's still pre-order even if it look like in-order. More specific it is be pre-order but only visits / evaluates the root if the left child is not NULL (aka a node with childs in your original non-binary tree). However, in which order you traverse only affects the order of output. Please see my 2nd post for a comparison...
 singulars
 PostPostId
 PO
 UserUserId
 USuser2927610

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.