+1 vote
in Data Structures & Algorithms I by (110k points)
2-3-4 trees are B-trees of order 4. They are an isometric of _____ trees.

(a) AVL

(b) AA

(c) 2-3

(d) Red-Black

This question is from B-Trees in chapter B-Trees of Data Structures & Algorithms I

I had been asked this question by my school teacher while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right choice is (d) Red-Black

Best explanation: 2-3-4 trees are isometric of Red-Black trees. It means that, for every 2-3-4 tree, there exists a Red-Black tree with data elements in the same order.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.