- (i). [4 marks] Given a binary search tree T3 as shown in Fig. 3, show the nodes examined when searching for 45. - (ii). [7 marks] Given a binary search tree T3 as shown in Fig. 3, draw the binary search tree after inserting 26, 42 in order. - (iii). [7 marks] Given a binary search tree T, as shown in Fig. 3, draw the binary search tree after deleting 36, 49 in order. 5 15 25 36 38 43 49 37 47 53 59 Fig. 3. A Binary Search Tree T3 for Q5