- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- trees are B-trees of order 4. They are a...

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 |

View all MCQs in:
Data Structures (DS)

- Why to prefer red-black trees over AVL trees?
- 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.
- 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?
- The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is
- B-tree of order n is a order-n multiway tree in which each non-root node contains
- If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?

Login to Continue

It will take less than 2 minutes

Report MCQ