Use the dataset below to draw the binary search tree obtained by inserting the 15 strings in the given order into an initially empty binary search tree. Add the threads to turn your tree into a threaded binary search tree:

prov, supp, enco, dire, stud, atte, rele, lite, occa, tech, assi, read, comm, draf, repo

Traverse the tree in preorder using a non recursive algorithm. Write down the order in which the nodes would be visited.