Posted by Will Renner on November 02, 19100 at 09:51:41:

In Reply to: Re: lexicographical order posted by Gerom on October 31, 19100 at 19:51:37:

: So would A be the root of an alphabet tree, or would Z?

The first element inserted becomes the root in a binary

search tree (I assume this is the kind of tree you're talking

about because that's the question from the HW).

If I insert A then B then C, you get

A

\

B

\

C

On the other hand if I insert B then A then C,

first B becomes the root. Then A "trickles down" to

the left and then C "trickles down" to the right.

B

/ \

A C

Hope that clarifies things