Consider the following set of values and use them to build the indicated type of tree by adding one value at a time in the order listed:

30 63 2 89 16 24 19 52 27 9 4 45

(a) binary search tree (b) AVL tree (c) 2-3 tree

List the efficiencies of binary search tree, AVL tree and 2-3 tree in the worse case for the operations of insertion