Binary tree

The minimum size that an array may require to store a binary tree with ‘n’ nodes is _______.

A    log2log2(n+1)−12log2(n+1)−1

2^{n}-1

C  n + 1

1Comment
Akshay Saxena @akshay0612
3 Dec 2017 10:07 pm

\(2^{n}-1\)
Think about skewed tree
          4
     /          \
   null          8
    /      \     /       \
 null null     null  7