BTree information

I am trying to find information regarding creation of B-tree index in
postgres for variable length
character data (Char/varchar type). Specifically, what pagination policy
is used, does it use prefix,
or any other form of compression (encoding)?

Regards,
VJ Anand