Question d’entretien chez nference

Given a binary complete tree which is level sorted find a number K.