DSA Homeowrk 6
1
BCS1223 - Data Structures and Algorithms Homework 6 Due: 22/05/2015 0% for submission after due date 1. You have learned in the lecture that 2-3 tree is a balanced search tree. By using your own words: • Describe how you would extend a 2-3 tree to a 2-3-4 tree. • Is a 2-3-4 tree a balanced tree just like 2-3 tree? Why? • State the advantage and disadvantage (if any) it has compared to a 2-3 tree. • Sketch an example representation of 2-3-4 tree using red-black tree (if possible). • Finally, explain whether there is any advantage to continue to extend it to 2-3-4-5 tree, 2-3-4-5-6-... tree? Justify your answer. (10 marks)
-
Upload
viveekdeep-singh -
Category
Documents
-
view
1 -
download
0
description
Data S and Algo
Transcript of DSA Homeowrk 6
BCS1223 - Data Structures and AlgorithmsHomework 6Due: 22/05/20150% for submission after due date
1. You have learned in the lecture that 2-3 tree is a balanced search tree. By using your ownwords: Describe how you would extend a 2-3 tree to a 2-3-4 tree. Is a 2-3-4 tree a balanced tree just like 2-3 tree? Why? State the advantage and disadvantage (if any) it has compared to a 2-3 tree. Sketch an example representation of 2-3-4 tree using red-black tree (if possible). Finally, explain whether there is any advantage to continue to extend it to 2-3-4-5 tree,2-3-4-5-6-... tree? Justify your answer.(10 marks)
