- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- Why to prefer red-black trees over AVL t...

Q. |
## Why to prefer red-black trees over AVL trees? |

A. | Because red-black is more rigidly balanced |

B. | AVL tree store balance factor in every node which costs space |

C. | AVL tree fails at scale |

D. | Red black is more efficient |

Answer» B. AVL tree store balance factor in every node which costs space |

View all MCQs in:
Data Structures (DS)

- Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
- 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
- trees are B-trees of order 4. They are an isometric of trees.
- What is an AVL tree?
- What is the maximum height of an AVL tree with p nodes?
- What maximum difference in heights between the leafs of a AVL tree is possible?
- If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
- 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.
- Which of the following is not an advantage of trees?
- Which of the following is incorrect with respect to binary trees?

Login to Continue

It will take less than 2 minutes

Report MCQ