binary trees, successor function

hello,
its from CLR. prove that starting from any node of a binary tree
if you call successor function k times continuously, it will take
O(k+h).
bye

.