Provide a list of ten elements in insertion order leading to a binary tree that is an example of a degenerate tree with O(N) search performance after all elements are inserted. Explain why this happens, and suggest an alternative insertion order that achieves O(log N) search efficiency. Draw both of the resulting trees.