+1 vote
in Data Structures & Algorithms I by (110k points)
Elements in a tree can be indexed by its position under the ordering of the keys and the ordinal position of an element can be determined, both with good efficiency.

(a) true

(b) false

This interesting question is from Weight Balanced Tree topic in division Binary Trees of Data Structures & Algorithms I

The question was asked during an internship interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (a) true

To explain: In a weight balanced tree we can even store the key information so as to use as a key value pair.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.