how the ans could be n+1?
The Number of wasted pointers in a complete binary tree of N nodes is?
@tishya_goyal
Wasted Pointers are leaf nodes.
The number of leaf nodes in a full binary tree are 2h.
The number of NULL links (wasted pointers) in a complete binary tree of n nodes are n+1.
i hope your doubt is cleared if yes don’t forget to mark it as resolved 
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.