in DS recategorized by
825 views
3 votes
3 votes

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

  1. $4$
  2. $8$
  3. $16$
  4. $32$
in DS recategorized by
825 views

1 Answer

3 votes
3 votes
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
Answer:

Related questions