spliting a binary search tree in half in O(h) time complexity

Question

I am practicing binary search trees and i have to answer a problem: A tree struct is given as

struct tree{
    int key;
    int lcnt;
    struct tree *lc;