recategorized
4,480 views

2 Answers

1 votes
1 votes
I think Doubly linked list

Reason:

only the node to be inserted/deleted needs to be manipulated and no traversals in forward or backward direction required for the operation so it is more efficient. :)
Answer:

Related questions

1 votes
1 votes
1 answer
3
shivani2010 asked Jun 9, 2016
4,137 views
The min. number of nodes in a binary tree of depth d (root at level 0) is$(2^d + 1)$$(2^{(d+1)} - 1)$$d$$d + 1$