- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- For the tree below, write the in-order t...

Q. |
## For the tree below, write the in-order traversal. |

A. | 6, 2, 5, 7, 11, 2, 5, 9, 4 |

B. | 6, 5, 2, 11, 7, 4, 9, 5, 2 |

C. | 2, 7, 2, 6, 5, 11, 5, 9, 4 |

D. | none |

Answer» A. 6, 2, 5, 7, 11, 2, 5, 9, 4 |

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
- What is the speciality about the inorder traversal of a binary search tree?
- Inorder traversal of binary search tree will produce _______________.
- The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be
- Graph traversal is different from a tree traversal, because
- For the tree below, write the pre-order traversal.
- For the tree below, write the post-order traversal.
- For the tree below, write the level-order traversal.
- 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?
- Find the postorder traversal of the binary tree shown below.

Login to Continue

It will take less than 2 minutes

Report MCQ