Algorithm to find largest continuous block in AVL tree

Question

Essentially, I want an algorithm that will return the starting value and length of the longest block of continuous integers in an AVL tree. Can this be done in O(log N) comp