edited by
579 views

1 Answer

1 votes
1 votes
To have the minimum size of an array we need to have complete BT and almost complete BT.

Worst case will be for right skewed BT. Here many spaces in an array will be blank.

Indexing Scheme used:

Left Child: 2 * i

Right Child: 2 * i + 1

where i is parent index.

Related questions

0 votes
0 votes
0 answers
2
Na462 asked Jan 16, 2019
388 views
Consider a binary tree for every node | P - Q | <= 2. P represents number of nodes in left subtree of S and Q represents number of nodes in right subtree of S for h 0. T...
0 votes
0 votes
0 answers
4