McqMate

Q. |
## trees are B-trees of order 4. They are an isometric of trees. |

A. | AVL |

B. | AA |

C. | 2-3 |

D. | Red-Black |

Answer» D. Red-Black |

1.1k

0

Do you find this helpful?

4

View all MCQs in

Data Structures (DS)No comments yet

- Why to prefer red-black trees over AVL trees?
- If two trees have same structure and but different node content, then they are called ___
- If two trees have same structure and node content, then they are called ____
- 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 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?
- What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.
- The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
- If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
- The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be
- 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?