Question d’entretien chez Turnitin

Traversing a ordered binary tree and finding the nth biggest number.