algorithim to check the minmium before a number in an avl tree and the minmum after a number in avl tree

Question

given an Avl tree that each node contains two numbers. for example: node 1 contains : (1,10) how is it possible to find the minimum before a given number i and the minimum a