int FindKth(TreeNode * t, int k)
// precondition:  t is not NULL, the size fields of all nodes in t
//                are correctly initialized.
//                1 <= k <= t->size
// postcondition: returns the kth value in t
{
    int leftSize = 0;
    if (t->left != NULL) leftSize = t->left->size;

    if       (k == leftSize + 1) return t->info;
    else if  (k <  leftSize + 1) return FindKth(t->left,k);
    else                         return FindKth(t->right,
						k - (leftSize + 1));
}