Quiz On Trees, Question 6th of quiz

#1

question 6th’s answer should be 2^(h)-1 instead of 2^(h-1). please correct it.

#2

@rahulgoindi15 Please share the question. If the answer is marked wrong, i will report it.

#3

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.

#4

Hello @rahulgoindi15,

Thanks for pointing out the mistake.:+1:
The CB team will correct it soon.