one person chooses, in his|her mind only a number N between 0 and 31
other start at node 16 and ask "is N smaller than 16?" ... if the answer is "yes", You will take the upper/left road leading to number 8 ... if the answer is "no", You will take the lower/right road leading to number 24
now You ask, "is N smaller than 8?" (or 24)...again, if the answer is "yes", You take the upper/left road (leading You to 4, resp. 20), in other case You take the lower/right road (leading You to 12, resp. 28)
You repeat two more times until You reach the leaves of the tree....if N is odd, the leaf node where You finished is the number N
(if number N is even, than it is one of those numbers which You traversed on Your path, e.g. 16,24,20 or 22 if You ended up at leaf 23)
then another person invents the number and others guess.
P.S. this binary tree will help You : https://kastalia.medienhaus.udk-berlin.de/7815