- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- To obtain a prefix expression, which of ...

Q. |
## To obtain a prefix expression, which of the tree traversals is used? |

A. | Level-order traversal |

B. | Pre-order traversal |

C. | Post-order traversal |

D. | In-order traversal |

Answer» B. Pre-order traversal |

View all MCQs in:
Data Structures (DS)

- Which of the following pair’s traversals on a binary tree can build the tree uniquely?
- 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 properties are obeyed by all three tree – traversals?
- The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is
- Which of the following graph traversals closely imitates level order traversal of a binary tree?
- In a binary search tree, which of the following traversals would print the numbers in the ascending order?
- 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
- 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.
- The prefix form of an infix expression (p + q) – (r * t) is?

Login to Continue

It will take less than 2 minutes

Report MCQ