Solved

# BST

Posted on 2007-11-17
384 Views
How do i construct BST based on the following:
12, 11, 8, 16, 5, 7, 13, 9, 2

I have been thinking about this for quite some time. Inorder traversal is not suitable as it returns a list of ascending numbers. I have also tried preorder and postorder traversal....but it doesn't seem to work. Pls help.

I just need a diagram to illustrate the BST.
0
Question by:dandeliondream
• 5
• 4
• 2
• +1

LVL 55

Expert Comment

ID: 20306857
Have a look to this tutorial:
http://en.wikipedia.org/wiki/Binary_search_tree
0

LVL 3

Author Comment

ID: 20306900
i think it shld be a preorder since postorder and inorder starts with 2. right? i have seen the tutorial.. :( not very useful pls help
0

LVL 84

Assisted Solution

ozo earned 50 total points
ID: 20306905
Depending on what you mean by "based" it could be
12
11             16
8                13
5      9
2   7
0

LVL 55

Assisted Solution

Jaime Olivares earned 50 total points
ID: 20306928
I have not clear your question.
Traversal is done AFTER tree is created. Tree internal shape will depend how you have inserted the nodes into it.
In-order traversal will always give you an ordered result.
pre-order and post-order will give you "unordered" result but exact sequence will depend on internal shape.
0

LVL 3

Author Comment

ID: 20306948
12, 11, 8, 16, 5, 7, 13, 9, 2 is the sequence from left to right after a traversal is done. It may be preorder, postorder or inorder traversal. Based on the sequence, how can i construct a BST?
0

LVL 53

Expert Comment

ID: 20307196
You want to store the values 12, 11, 8, 16, 5, 7, 13, 9, 2 in a BST in that exact order ? Why use a BST then ? Why not just an array or a vector ?

There's no point. A BST's strength is that it makes searching of an ORDERED series a lot faster. You'd have to add a second index value that acts as key into the BST, and store the value as data. Sounds a bit overkill to me. Just take an array or vector.
0

LVL 3

Author Comment

ID: 20307319
no that's not what i meant. I want a diagram like what mr. ozo has given me earlier. Construct a BST based on the list of numbers The numners are to be processed from left to right.
12, 11, 8, 16, 5, 7, 13, 9, 2

Not a program. Just a diagram.
0

LVL 53

Expert Comment

ID: 20307322
Yes, but there's two orders :

1) the order you put the values into the BST
2) the order you get them out of the BST

Which are you referring to when you want to get this order : 12, 11, 8, 16, 5, 7, 13, 9, 2 ?
0

LVL 3

Author Comment

ID: 20307390
the second one...
0

LVL 53

Expert Comment

ID: 20307393
>> the second one...

Then I repeat : there's no point in using a BST - just use a simple array or vector.
0

LVL 3

Author Comment

ID: 20307432
ok, thanks. what will the result be if it is the first one?
0

LVL 53

Accepted Solution

Infinity08 earned 150 total points
ID: 20307438
>> ok, thanks. what will the result be if it is the first one?

A BST that looks like what ozo showed. You can of course balance the tree out, but you will not be able to get the values out the same order you put them in there (unless by chance).
0

## Featured Post

### Suggested Solutions

This article will show, step by step, how to integrate R code into a R Sweave document
Basic understanding on "OO- Object Orientation" is needed for designing a logical solution to solve a problem. Basic OOAD is a prerequisite for a coder to ensure that they follow the basic design of OO. This would help developers to understand the bâ€¦
The goal of the video will be to teach the user the difference and consequence of passing data by value vs passing data by reference in C++. An example of passing data by value as well as an example of passing data by reference will be be given. Botâ€¦
The viewer will learn how to user default arguments when defining functions. This method of defining functions will be contrasted with the non-default-argument of defining functions.