Problem
1. Dr. Amongus claims that the order in which a fixed set of entries is inserted into a binary search tree does not matter- the same tree results every time. Give a small example that proves he is wrong.
2. Dr. Amongus claims that the order in which a fixed set of entries is inserted into an AVL tree does not matter-the same AVL tree results every time. Give a small example that proves he is wrong.