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.
Answer for below question
Hi @Faizan-Ali-1395131367301898
Answer should be 2^n — 1 because for a right skewed binary tree, number of nodes will be 2^n – 1.