Computer Science, asked by riyadhruv12, 2 days ago

There are several self balancing types of trees, most popular are AVL and Red-Black. If you put same data in those trees, the resulting trees would be
a.different
b.same
c.similar
d.partially same​

Answers

Answered by RimjhimBarman
1

Answer:

No. B Similar i think? Yup maybe

Answered by vianne83
0

Answer:

A. Different

Explanation:

As A matter of fact AVL is much more faster , because AVL trees are less depth .The fact that Red black trees have less rotation can make them faster on inserts/deletes.

Similar questions