Register

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

• recategorized by
1,845 views

1 Answer

5 votes
5 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
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
4 answers
1
admin asked Mar 31, 2020
1,988 views
NIELIT 2016 DEC Scientist B (IT) - Section B: 15
A ________ is a linear list in which insertions and deletions are made to from either end of the structure. Circular queue. Priority queue. Stack. Dequeue.
A ________ is a linear list in which insertions and deletions are made to from either end of the structure.Circular queue.Priority queue.Stack.Dequeue.
User Avatar
2 votes
2 votes
1 answer
2
admin asked Mar 31, 2020
2,411 views
NIELIT 2016 DEC Scientist B (IT) - Section B: 16
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with $n$ discs is: $T(n)=2T(n-2)+2$ $T(n)=2T(n/2)+1$ $T(n)=2T(n-1)+n$ $T(n)=2T(n-1)+1$
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with $n$ discs is:$T(n)=2T(n-2)+2$$T(n)=2T(n/2)+1$$T(n)=2T(n-1)+n$$T(n)=2T(n-1...
User Avatar
3 votes
3 votes
2 answers
3
admin asked Mar 31, 2020
2,546 views
NIELIT 2016 DEC Scientist B (IT) - Section B: 17
Which of the following is the correct order of evaluation for the below expression? $z=x+y^*z/4\%2-1$ $^*/\%+-=$ $=^*/\%+-$ $/^*\%-+=$ $^*\% /-+=$
Which of the following is the correct order of evaluation for the below expression? $z=x+y^*z/4\%2-1$$^*/\%+-=$$=^*/\%+-$$/^*\%-+=$$^*\% /-+=$
User Avatar
3 votes
3 votes
1 answer
4
admin asked Mar 31, 2020
885 views
NIELIT 2016 DEC Scientist B (IT) - Section B: 30
What data structures is used for depth first traversal of a graph? Queue Stack List None of the above
What data structures is used for depth first traversal of a graph?QueueStackListNone of the above
User Avatar
Link Copied!