Construct a 2 3 tree for the list h,o,u,s,e,w,a,r,m,i,n,g. Use the alphabetical order of the letters and insert them successively starting with the empty tree