+1 vote
in Data Structures & Algorithms I by (110k points)
How many bits would a succinct binary tree occupy?

(a) n+O(n)

(b) 2n+O(n)

(c) n/2

(d) n

My question is from Binary Trees topic in division Binary Trees of Data Structures & Algorithms I

The question was asked in unit test.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct option is (b) 2n+O(n)

The best I can explain: A succinct binary tree occupies close to minimum possible space established by lower bounds. A succinct binary tree would occupy 2n+O(n) bits.

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.

Categories

...