The following is a preorder traversal of a binary tree:
PREORDER: 9,5,3,1,4,8,6,20,12,10,11,30,21,31
a)Draw the Binary Search Tree T.
b)Based on TRANSPLANT(T,5,8),draw the left subtree of theroot(you do not need to draw the whole tree.)
Answer:
Expert Answer
An answer will be send to you shortly. . . . .