- Computer Science Engineering (CSE)
- Data Structures (DS)
- When elements are deleted the nodes go t...

Q. |
## When elements are deleted the nodes go to_________. |

A. | registers. |

B. | free pool. |

C. | recycle bin. |

D. | gets deleted permanently. |

Answer» B. free pool. |

View all MCQs in:
Data Structures (DS)

- If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
- A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
- If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?
- In a full binary tree if number of internal nodes is I, then number of nodes N are?
- The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
- The OS of a computer may periodically collect all the deleted space onto the free storage list. This technique is called______________.
- An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
- What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
- What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.
- The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is

Login to Continue

It will take less than 2 minutes

Report MCQ