- Computer Science Engineering (CSE)
- Data Structure (DS)
- To represent hierarchical relationship b...

Q. |
## To represent hierarchical relationship between elements, Which data structure is suitable? |

A. | dequeue |

B. | priority |

C. | tree |

D. | graph |

Answer» C. tree |

View all MCQs in:
Data Structure (DS)

- To represent hierarchical relationship between elements, which data structure is suitable?
- Which data structure allows deleting data elements from and inserting at rear?
- Which of the following data structure can’t store the non-homogeneous data elements?
- Which data structure allows deleting data elements from front and inserting at rear?
- Which of the following data structure can’t store the non-homogeneous data elements?
- Which of the following data structure is not linear data structure?
- A list which displays the relationship of adjacency between elements is said to be
- A data structure where elements can be added or removed at either end but not in the middle is called …
- A data structure where elements can be added or removed at either end but not in the middle is called …
- Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

Login to Continue

It will take less than 2 minutes

Report MCQ