- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- Consider the following data. The pre ord...

Q. |
## 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 |

A. | A, C, D, B, E |

B. | A, B, C, D, E |

C. | A, B, C, E, D |

D. | D, B, E, A, C |

Answer» B. A, B, C, D, E |

View all MCQs in:
Data Structures (DS)

- 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?
- A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
- When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
- Which of the following graph traversals closely imitates level order traversal of a binary tree?
- Graph traversal is different from a tree traversal, because
- For the tree below, write the pre-order traversal.
- For the tree below, write the level-order traversal.
- What is the traversal strategy used in the binary tree?
- How many orders of traversal are applicable to a binary tree (In General)? 3

Login to Continue

It will take less than 2 minutes

Report MCQ