Exercicio :: Binary tree 1-32 Wed, 22 Jun 2022 09:13:48 GMT 2022-06-22T09:13:48Z You will be divided into break-out rooms in which You will play the "number guessing game". Game goes like this: <br><p class="fragment">one person chooses, in his|her mind only a number N between 0 and 31</p> <br><p class="fragment">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</p> <br><p class="fragment">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)</p> <br><p class="fragment">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</p> <br><p class="fragment">(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)</p> <br><p class="fragment">then another person invents the number and others guess.<br /><br />P.S. this binary tree will help You :&nbsp;<a class="linkified" style="font-family: Inter, system-ui, -apple-system, 'Apple Color Emoji', Twemoji, 'Segoe UI Emoji', sans-serif; white-space: pre-wrap; background-color: #f0f0f0; border-radius: unset !important;" href="https://kastalia.medienhaus.udk-berlin.de/7815" target="_blank" rel="noreferrer noopener">https://kastalia.medienhaus.udk-berlin.de/7815</a></p> Info