B) Suppose the following list of letters is inserted in an order into an empty list binary search tree J,R,D,G,T,E,M,H,P,A,F,Q Using the insertion algorithm of binary search tree: 1. Construct the...

Extracted text: B) Suppose the following list of letters is inserted in an order into an empty list binary search tree J,R,D,G,T,E,M,H,P,A,F,Q Using the insertion algorithm of binary search tree: 1. Construct the tree. 2. Traverse it, in in-order form. 3. Apply searching Algorithm to find the location of node F'. Mention the Number of Comparison that are made until you find location 'F'.