k predecessors of an element in height balanced binary tree in O(k + log n) time
Given a height balanced binary tree T, report k predecessors of an element x in T in O(k + log n) time. 
k predecessors of an element in height balanced binary tree in O(k + log n) time
===

Given a height balanced binary tree T, report k predecessors of an element x in T in O(k + log n) time. 