Question
If elements are inserted into a Binary Search Tree in
strictly ascending order (e.g., 1, 2, 3, 4, 5), what will be the resulting structure of the tree?Solution
If elements are inserted in strictly ascending (or descending) order, each new element will always be inserted as the right (or left) child of the previous element, creating a degenerate tree that behaves like a linked list.
Find out the alternative figure which contains figure (X) as its part.
From the given answer figures, select the one in which the question figure is hidden/embedded.
Find out the alternative figure which contains the given figure as its part.
Choose the correct mirror image of the given figure (X) from amongst the four alternatives.
From the given answer figure select the one in which the question figure is hidden/embedded in the same direction.
Select the option in which figure is embedded.
From the given answer figures, select the one in which the question figure is hidden/ embedded.
From the given answer figure select the one in which the question figure is hidden/embedded in the same direction.
