Data Structures and Algorithms

$,$

Homework $3$

Insert the following set of keys $\{3,6,10,5,9,4,7,2,8,1,11,12\}$ in an empty binary search tree in the order they are listed.

$[10$ marks

Insert the following set of keys $\{3,6,10,5,9,4,7,2,8,1,11,12\}$ in an empty $(2,4)$ tre in the order they are listed.

$[10$ marks

Insert the following set of keys $\{3,6,10,5,9,4,7,2,8,1,11,12\}$ in an empty red$-$blac tree in the order they are listed.

$[10$ marks

$[$Instruction: You need not to write any code for this homework. Show the steps while adding the keys in your tree$]$