NIELIT 2016 DEC Scientist B (IT) - Section B: 13

Question

The number of unused pointers in a complete binary tree of depth $5$ is:

• A. $4$
• B. $8$
• C. $16$
• D. $32$

Answer 1

Assuming , Unused pointers are pointers that are not used

for a complete binary tree of depth i , will have 2^i nodes

only the leaf nodes , the pointer variables will be unused,since all the internal nodes  will point  to other nodes

at level i =5 will have 2 ^ 5 = 32 nodes