# 2-3-4 trees are B-trees of order 4. They are an isometric of _____ trees.

Category: Questions2-3-4 trees are B-trees of order 4. They are an isometric of _____ trees.
Editor">Editor Staff asked 5 months ago

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.

Editor">Editor Staff answered 5 months ago

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.

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702