StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
20732203
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
2
CommunityOwnedDate
CreationDate
2013-12-22T17:45:24.887
FavoriteCount
0
LastActivityDate
2013-12-22T17:51:17.800
LastEditDate
2013-12-22T17:51:17.800
LastEditorUserId
1620671
OwnerUserId
1620671
ParentId
20731833
PostTypeId
2
Score
6
ViewCount
0
LastEditorDisplayName
text
Body
The idea behind a binary tree is that it is sorted. Any values larger than the current value are in the right node and every value smaller is in the left node. That means you shouldn't do the tree-building in your main program. Rather, every node should have an "insert" method which determines whether the new node should go to the left or the right of the current node. When you have a new node, you create that node, and then you call <code>root.insert(newNode)</code>. The insert-method would then work like this (because this is obviously a student assignment and you are supposed to learn from it, you only get pseudo-code from me, no complete solution): <pre><code>When value is smaller than own value: When there already is a left-node: call left-node.insert(new-node) When there isn't a left-node yet: the left-node is now the new-node When value is larger than own value: When there already is a right-node: call right-node.insert(new-node) When there isn't a right-node yet: the right-node is now the new-node When value is equal to own value: Duplicate value. Either ignore the value or throw an exception. </code></pre> Finding if an object already is in the tree works the same way: <pre><code>When requested value is equal to the value of this node return this node When the requested value is smaller When a left node exists call left.find(value) When no left node exists value doesn't exist in this tree When the requested value is larger When a right node exists call right.find(value) When no right node exists value doesn't exist in this tree </code></pre> In the case you don't actually want to learn how binary trees work and just use them, just use <a href="http://docs.oracle.com/javase/7/docs/api/java/util/TreeSet.html" rel="noreferrer">TreeSet</a> which is an already working binary-tree implementation.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POConstructing a Binary tree in Java
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USPhilipp
UserOwnerUserId
1. USPhilipp
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. COBut then wouldnt it be a binary search tree.?? I just want to make a simple binary tree as given in the question
 singulars
 PostPostId
 PO
 UserUserId
 USVIN

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.