A binary search tree after inserting the keys: S E A R, in that order.

The value for a key is the number of insertions before and including the key.

      1  2  3  4
      S  E  A  R
   

What tree would you get if the insertion order was:

      1  2  3  4
      S  E  R  A