Question

Tree & Hash Table & Heap

Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings:

a) Binary Search Tree

- Draw a binary search tree

- Retrieve the integers keys in post-order

- Retrieve the integers keys in pre-order

- Draw a binary search tree after node 58 is deleted

b) Create a Hash Table using the methods described below. Show the final array after all integer keys are inserted. Assumes that the Hash Table is implemented using an array of size 13. The integer keys are
73, 58, 91, 42, 60, 130, 64, 87

• Linear Probing
  

Numbers
Index	0	1	2	3	4	5	6	7	8	9	10	11	12

• Quadratic Probing
  

Numbers
Index	0	1	2	3	4	5	6	7	8	9	10	11	12

• Double Hashing
  Constant = 5
  

Numbers
Index	0	1	2	3	4	5	6	7	8	9	10	11	12

b) Insertion and deletion in a Heap. Show the final array after all insertion and deletion are finished.

• Heap (Insert)
  

Numbers
Index	0	1	2	3	4	5	6	7	8	9	10	11	12

                Draw a binary tree from the heap array

Heap (Remove)

Numbers
Index	0	1	2	3	4	5	6	7	8	9	10	11	12

                Draw a binary tree from the heap array after the removal is performed

Answer 1

Please post remaining as another question