A scheme for storing binary trees in an array X is as follows. Indexing of X…
PYQ Hexaware Hiring Assessment 2023
A scheme for storing binary trees in an array X is as follows. Indexing of X starts at 1 instead of 0. The root is stored at X[1]. For a node stored at X[i], the left child, if any, is stored in X[2i], and the right child, if any, in X[2i+1]. To be able to store any binary tree on n vertices, the minimum size of X should be:
- A.
log2n
- B.
n
- C.
2n + 1
- D.
2n − 1
Attempted by 114 students.
Sign up free to check your answer
Sign up freeLoading lesson…

