Write the Binary Search Tree Tree-Predecessor procedure by filling in the blanks, selecting from Minimum, Maximum, left and right

Write the Binary Search Tree Tree-Predecessor procedure by filling in the blanks (following the style of Tree-Successor), selecting from Minimum Maximum, left and right Tree-Predecessorix) 1 if x. NIL 21 return Tree- (x 3 y = x.p 4 while y * NIL and X == y. 5 x=y 6 y = y.P 7 return y What is the worst-case runtime for Tree-Predecessor in terms of n, the number of keys in a binary search tree? 01 What is the expected case runtime for Tree-Predecessor in terms of n, in a binary search tree that was constructed by randomly ordered insertion of keys? ( )