Given an arbitrary binary tree structure with $n$ nodes explain algorithmically $($how would

you do it$?)$ why it is always possible to select $n$ distinct integers and assign them as node

keys within the structure so that the result is a binary search tree.