- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- Which of the following properties are ob...

Q. |
## Which of the following properties are obeyed by all three tree – traversals? |

A. | Left subtrees are visited before right subtrees |

B. | Right subtrees are visited before left subtrees |

C. | Root node is visited before left subtree |

D. | Root node is visited before right subtree |

Answer» A. Left subtrees are visited before right subtrees |

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 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?
- To obtain a prefix expression, which of the tree traversals is used?
- The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is
- When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
- 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
- In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ 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?

Login to Continue

It will take less than 2 minutes

Report MCQ