Question

Consider the following list of numbers.
128, 685, 126, 513, 605, 50, 41
The height of a binary search tree is the maximum number of edges you have to go through to reach the bottom of the tree, starting at the root. What is the height of the tree for the numbers above, in the order given?

Answer 1

so, you are spose to treeup those numbers eh ....

Answer 2

i binary tree is one in which "branches" stem in order, left < root < right; if we go "in the order given" that would start out as

128
126 685

Answer 3

513 is between 126 and 685
605 has to drop down since it cant fit
50 is less then 605
41 is less than 50


128
126 685
513
50 605
41

if i read that correctly

Answer 4

you might have to read thru it and correct me tho

Answer 5

so to answer the question for the height above is that i have to add 128+126+685?

Answer 6

no, the height of the tree is the number of "rows" that are formed

Answer 7

@amistre64 can we arrange in the way,

Answer 8

128
126 685
50 513
41 605

of course it might go like this

Answer 9

128 < 605 so it would have to go on the right side

Answer 10

thank you.

Answer 11

so 2 rows?

Answer 12

wait, 4 rows?

Answer 13

row1 128
row2 126 685
row3 50 513
row4 41 605

Answer 14

this question is so confusing .. if its above then 2 rows

Answer 15

im still trying to iron out a few "rules" to be sure :)

Answer 16

ok the answer is not 2 or 4! crap

Answer 17

is it not 3? we have 4 rows, so the edge between them is 3, is it not right?

Answer 18

and by definition of "height of tree" it's the number of the edge from top to bottom?

Answer 19

ok that makes sense

Answer 20

yup 3 was it! thanks guys

Answer 21

thanks for your post, too. I studied the stuff this semester and so confused. review here, XD!!!

Answer 22

thnx Hoa :)

Answer 23

you have 99 smartscore , no way to show appreciation!!! so just "Thank you very much, 99 smart guy!!!"

Answer 24

thanks Hoa
:)))))