For the next two questions you must determine the insertion order of the titles of the movies identified below into an empty Binary Search Tree so that a binary tree of the specified shape is created. Comparisons are based on alphabetical order, i.e., words appearing earlier in a standard dictionary are less than words that appear later in the dictionary. Your answers must list the movies in insertion order, from left to right.

Juno Argo Fargo Pyscho Casino Vertigo Memento

1. In what order would you insert the movie titles identified above into an empty Binary Search Tree so that a binary tree with a maximum height is created? List the movies in insertion order, from left to right.

2. Create a perfect binary tree by inserting the movie titles identified above into an empty Binary Search Tree in an appropriate order. List the movies in insertion order, from left to right.