- Computer Science Engineering (CSE)
- Data Structure (DS)
- To perform level-order traversal on a bi...

Q. |
## To perform level-order traversal on a binary tree, which of the following data structure will be required? |

A. | Hash table |

B. | Queue |

C. | Binary search tree |

D. | Stack |

Answer» B. Queue |

View all MCQs in:
Data Structure (DS)

- A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
- Which of the following data structure is not linear data structure?
- A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
- The property of binary tree is
- In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
- In doubly linked lists, traversal can be performed?
- Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?
- The data structure required to evaluate a postfix expression is
- Which of the following data structure can’t store the non-homogeneous data elements?
- Which of the following data structure can’t store the non-homogeneous data elements?

Login to Continue

It will take less than 2 minutes

Report MCQ