- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- A binary search tree contains values 7, ...

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

A. | 7, 8, 26, 13, 75, 40, 70, 35 |

B. | 26, 13, 7, 8, 70, 75, 40, 35 |

C. | 7, 8, 13, 26, 35, 40, 70, 75 |

D. | 8, 7, 26, 13, 40, 75, 70, 35 |

Answer» D. 8, 7, 26, 13, 40, 75, 70, 35 |

View all MCQs in:
Data Structures (DS)

- 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___________.
- Find the postorder traversal of the binary tree shown below.
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
- An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by
- A binary tree of depth "d" is an almost complete binary tree if __________.
- 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?
- In a binary search tree, which of the following traversals would print the numbers in the ascending order?
- Which of the following is false about a binary search tree?
- Which of the following is not the self balancing binary search tree?

Login to Continue

It will take less than 2 minutes

Report MCQ