Data Structures and Algorithms: BST.

Complete the Pseudocode of the successor function for a BST located in the picture below. Please fill in the missing code for lines 9 and 14.

Exam 1 CIS 350: Data Structures and Algorithm Analysis Winter 2019 2. ( 4 pts.] Complete the pseudocode of the successor function for a BST, started for you e partial pseudocode given in Algorithm 6, by writing down the only two missing statements (in line indexes 9 and 14). The function outputs the node y with the next key in the order sequence following that of node w with respect to the BST, or NULL if w has the largest key Algorithm 6 successor(w) 1: if w = NULL then 2: NULL ne 9: 3: else if to-right = NULL then 5: 6: 7: 8: 9: y x.parent while y NULL and y.right z do ine 14: 10 end while 11: else 12: 13: 4: 5: : end if : end if :return y while y.right NULL do end while Using big-Oh notation, provide a tight worst-case running time of the method function of the number of nodes n in the BST containing w