2 2 votes A GO Tree is a rooted binary tree defined as follows:For every node $u$ (except the root): Let parent $(u)$ be the parent of $u$.Define:$\operatorname{Side}(u)=0$ if $u$ is a left child, $\operatorname{Side}(u)=1$ if $u$ is a right child.The tree satisfies the GO property if on every root-to-leaf path, the value of $\operatorname{Side}(u)$ changes at most once.Consider a GO Tree with $n$ nodes.Which of the following statements is/are necessarily true?A GO TREE CAN HAVE HEIGHT $n-1$ EVERY ROOT-TO-LEAF PATH CONTAINS AT MOST ONE LEFT EDGE FOLLOWED BY A RIGHT EDGE A GO TREE WITH $n$ NODES CAN HAVE $\Theta(\log n)$ HEIGHT EVERY GO TREE IS A COMPLETE BINARY TREE Data Structures goclasses python-&-dsa goclasses-da-dpp goclasses-da-dpp-day-78 goclasses-python-&-dsa-practice-questions multiple-selects + – GO Classes 306 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote Option A: A path that always goes left (or always right) has zero flips, so a chain of n nodes is allowed. Hence height can be $n-1$. Option B: By definition, Side(u) can change at most once on any root-to-leaf path, so multiple alternations like $L \rightarrow R \rightarrow L$ are not allowed. Option C: A perfectly balanced tree where all left edges are taken first and right edges only after one level satisfies the Flip-Path property and has height $\Theta(\log n)$. Option D: False. The tree may be highly skewed or partially filled. GO Classes answered Jan 1 GO Classes comment Share Follow 0 reply Please log in or register to add a comment.