Please Write C Psuedo Code 1 (50.67 KiB) Viewed 37 times
Please Write C Psuedo Code 2 (9.36 KiB) Viewed 37 times
Please Write C Psuedo Code 3 (4.07 KiB) Viewed 37 times
Please Write C Psuedo Code 4 (7.74 KiB) Viewed 37 times
Problem 2. Using the procedure TREE-SUCCESSOR and TREE-MINIMUM, write a function F(x), where x is a node in a binary search tree, to produce the output that INORDER- TREE-WALK function would produce. Determine the upper bound running time complexity of F(x) and prove its correctness.
TREE-SUCCESSOR (X) if x.right # NIL 1 2 3 4 5 6 7 return TREE-MINIMUM (x.right) y = x.p while y NIL and x == y.right x = y y = y.p return y
TREE-MINIMUM (X) while x.left # NIL x = x.left return x 1 2 3
INORDER-TREE-WALK (x) 1 if x # NIL 2 3 4 INORDER-TREE-WALK (x.left) print x.key INORDER-TREE-WALK (x.right)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!