Thumb up for the solution, thx!

6) Binary Search Tree. (10 marks) Beginning with an empty binary search tree, insert the following key values one by one and show the resulting binary search tree T after al insertions (i.e. show only the final tree). 1, 3, 5,7,9, 2, 4, 6, 8. a) from Part (a) Consider the operation of a right rotation on a binary search tree T on the nodes x and y After the rotation, x becomes the parent of y. c) i) Initially, let the left and right subtrees under x be a and B, respectively, and let the right subtree under y be y. Draw the diagram of the subtree of T rooted at y before the right rotation, and the subtree rooted at x after the right rotation. ii) The attibutes of a nodex are x.key, x.left, x.right, x.p. Assume that subtrees ?, ?, and ? are not empty and y is not the root ofT. Complete the pseudocode below for right-rotate RIGHT-ROTATE(T,y) x = y.left y.left x.right x.right.p y if yy.p.left