[Solved]1 Binary Search Tree Create Binary Search Tree Based Given Sequence 5 3 1 10 12 7 9 B Del Q37261127
Explain each step please so i understand
1. Binary Search Tree: a. Create a binary search tree based on a given sequence, such as 5, 3, 1, 10, 12, 7,9 b. Delete 3 keys 5, 10, 9 c. Insert 3 keys 6, 15, 8 d. Draw the changes of the binary tree step by step 2. AVL Tree: 1. Create an AVL tree for the list 5,6,8,3,2.4.7. Illustrate the tree step by step as showing in the lecture slides. 3.2-3 Tree: 1. Construct a 2-3 tree for the list 9,5,8,3,2,4,7 4. Heap: 1. Construct a heap for a list 2,9,7,6,5,8. Illustrate the heap construction step by step 2. Output a sorted list based on a heap using heapsort algorithm. 5. Hashing: For the input 30, 20, 56, 75, 31, 19 and hash function h(k) k mod 11 a. construct the closed hash table successful search in this table. successful search in this table. b. find the largest number of key comparisons in a number of key comparisons in c. find the average a Show transcribed image text 1. Binary Search Tree: a. Create a binary search tree based on a given sequence, such as 5, 3, 1, 10, 12, 7,9 b. Delete 3 keys 5, 10, 9 c. Insert 3 keys 6, 15, 8 d. Draw the changes of the binary tree step by step 2. AVL Tree: 1. Create an AVL tree for the list 5,6,8,3,2.4.7. Illustrate the tree step by step as showing in the lecture slides. 3.2-3 Tree: 1. Construct a 2-3 tree for the list 9,5,8,3,2,4,7 4. Heap: 1. Construct a heap for a list 2,9,7,6,5,8. Illustrate the heap construction step by step 2. Output a sorted list based on a heap using heapsort algorithm. 5. Hashing: For the input 30, 20, 56, 75, 31, 19 and hash function h(k) k mod 11 a. construct the closed hash table successful search in this table. successful search in this table. b. find the largest number of key comparisons in a number of key comparisons in c. find the average a
Expert Answer
Answer to 1. Binary Search Tree: a. Create a binary search tree based on a given sequence, such as 5, 3, 1, 10, 12, 7,9 b. Delete … . . .
OR
