Analysis of algorithms

Written response only

QUESTION Suppose that the following set of 11 strings are inserted into a TST (in some order). CANNON CAP CHARTER CLOISTER COLONIAL COTTAGE Y QUAD TERRACE TIGER TOWER )Suppose that the strings are inserted into the TST in alphabetical order. What is the height of the resulting TST? (The height of a 1-node TST is 0.) Circle your answer (b) Suppose that the strings are inserted into the TST in an order which minimizes the height. What is the height of the resulting TST? Circle your answer Words:0