- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- The maximum number of nodes in a tree fo...

Q. |
## The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is |

A. | 3 |

B. | 1 |

C. | 2 |

D. | any number |

Answer» B. 1 |

View all MCQs in:
Data Structures (DS)

- 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?
- The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
- Which of the following pair’s traversals on a binary tree can build the tree uniquely?
- Find the postorder traversal of the binary tree shown below.
- 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.
- In a full binary tree if number of internal nodes is I, then number of nodes N are?
- Which of the following properties are obeyed by all three tree – traversals?
- To obtain a prefix expression, which of the tree traversals is used?
- Which of the following graph traversals closely imitates level order traversal of a binary tree?

Login to Continue

It will take less than 2 minutes

Report MCQ