Question 2 alone

QUESTION 2 (20 marks) Create pseudo code that implement linked list using dynamic memory allocation by showing the followings: a) Type and structure definition (4 marks) b) Insertion of item into the list. (8 marks) C) Deletion of any node by matching a key obtained from the keyboard. (8 marks) QUESTION 3 (20 marks) a) Create a pseudo code for insertion sort using an array. (6 marks) b) Detail out the proceeds of the processes by explaining with the help of a state table of a 5 element (1-5) array as shown below. Round Timer timer Comment 79103 Key 45 179 109 79 30 61 123 (7 marks) c) Identify three (3) advantages and disadvantages of insertion sort. (3 marks) d) Identify a pair of advantage and disadvantage of Memory based Sorting. (2 marks) e) Identify any two (2) faster sorting algorithm and the technique used. (2 marks) QUESTION 4 (20 marks) a) Manually insert the following data into a binary search tree. Sketch. DATA 208 405 15 23 18 10 (3 marks) b) Develop the pseudo codes for the following Binary Search Tree functionalities i) insertNode. (11 marks) ii) inOrder Traversal (2 marks) iii) preOrder Traversal, (2 marks) ECB 2063 Feb, 2021(MAIN)