multi-column btree index for real values

Folks,

Can someone quickly describe how the btree is implemented for multiple
columns?  In particular, under what (if any) circumstances is there an
advantage if the index is over floating point values?

Thanks!

--Martin