Data Structures

(Sedgewick & Wayne) Inserting the keys in the order AXCSERH into an ini- tially empty binary search tree gives a worst-case tree where every node has one null link, except one at the bottom, which has two null links. Give five other orderings of these keys that produce worst-case trees