- Computer Science Engineering (CSE)
- Data Structures (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. | Binary tree. |

Answer» C. Tree. |

View all MCQs in:
Data Structures (DS)

- A tree is a data structure which represents hierarchical relationship between individual _________.
- Which data structure allows deleting data elements from front and inserting at rear?
- Which of the following data structure is linear data structure?
- A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
- Data structure which is capable of expressing more complex relationship than that of physical adjacency 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
- New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.
- A linear collection of data elements where the linear node is given by means of pointer is called?
- Which data structure is needed to convert infix notation to postfix notation?
- Which data structure is used for implementing recursion?

Login to Continue

It will take less than 2 minutes

Report MCQ