StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
3532448
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2010-08-20T15:39:12.877
FavoriteCount
0
LastActivityDate
2010-08-20T15:39:12.877
LastEditDate
LastEditorUserId
0
OwnerUserId
117539
ParentId
3531606
PostTypeId
2
Score
5
ViewCount
0
LastEditorDisplayName
text
Body
The short answer is: you can't. A BST requires that the nodes follow the rule left <= current < right. In the example you linked: <a href="http://upload.wikimedia.org/wikipedia/commons/f/f7/Binary_tree.svg" rel="noreferrer">http://upload.wikimedia.org/wikipedia/commons/f/f7/Binary_tree.svg</a>, if you try and build a BST with the same shap you'll find that you can't. However if you want to stretch the definition of a BST so that it allows left <= current <= right (notice that here current <= right is allowed, as apposed to the stricter definition) you can. Sort all the elements and stick them in an array. Now do an in-order traversal, replacing the values at nodes with each element in your array. Here's some pseudo code: <pre><code>// t is your non-BST tree, a is an array containing the sorted elements of t, i is the current index into a index i = 0 create_bst(Tree t, Array a) { if(t is NIL) return; create_bst(t->left, a) t->data = a[i] i++ create_bst(t->right, a) } </code></pre> The result won't be a true BST however. If you want a true BST that's as close to the original shape as possible, then you again put the elements in a sorted array but this time insert them into a BST. The order in which you insert them is defined by the sizes of the subtrees of the original tree. Here's some pseudo-code: <pre><code>// left is initially set to 0 create_true_bst(Tree t, BST bt, array a, index left) { index i = left + left_subtree(t)->size bt->insert(a[i]) if(left_subtree(t)->size != 0) { create_true_bst(t->left, bt, a, left) create_true_bst(t->right, bt, a, i + 1) } } </code></pre> This won't guarantee that the shape is the same however.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POConvert Binary Tree -> BST (maintaining original tree shape)
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USNiki Yoshiuchi
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POConvert Binary Tree -> BST (maintaining original tree shape)
 singulars
 PostTypePostTypeId
 PTQuestion
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
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
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.