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

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

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

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

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

D. | none |

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

View all MCQs in:
Data Structures (DS)

- Find the postorder traversal of the binary tree shown below.
- 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
- Graph traversal is different from a tree traversal, because
- For the tree below, write the pre-order traversal.
- For the tree below, write the in-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?
- 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.

Login to Continue

It will take less than 2 minutes

Report MCQ