- Computer Science Engineering (CSE)
- Data Structures (DS)
- Graph traversal is different from a tree...

Q. |
## Graph traversal is different from a tree traversal, because |

A. | trees are not connected. |

B. | graphs may have loops. |

C. | trees have root. |

D. | None is true as tree is a subset of graph. |

Answer» C. trees have root. |

View all MCQs in:
Data Structures (DS)

- Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
- The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be
- The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
- Which of the following graph traversals closely imitates level order traversal of a binary tree?
- When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
- In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
- What is the traversal strategy used in the binary tree?
- How many orders of traversal are applicable to a binary tree (In General)? 3
- For the tree below, write the pre-order traversal.
- For the tree below, write the post-order traversal.

Login to Continue

It will take less than 2 minutes

Report MCQ