Binary Search, 2-3-4 Trees and Hash Tables
1.Given the following list of numbers, show the resulting binary search tree that is created:
5, 6, 7, 10, 1, 2, 15, 18, 25, 50, 23, 16
2. Now, show the resulting 2-3-4 tree that is created from the same set of numbers entered:
3. Based on the binary search tree that you've created, now use the delete algorithm to show the resulting binary tree when the following numbers are deleted
delete (16)
delete (6)
delete (25)
delete (5)
4. Based on the 2-3-4 tree you created, flag the same 4 numbers in the previous problem for deletion. Then, traverse the 2-3-4 tree in order to get the remaining numbers (i.e. identify in order, the numbers that are not marked for deletion).
5. Take that sequential order of numbers and show the new 2-3-4 tree with them.