*This question is from "Data Structure and Algorithms" subject.

2. Assume the Binary Search Tree stores strings in alphabetical order. Insert the following 14 names into an empty Binary Search Tree in the order they appear and draw the final Binary Search Tree. Jan, Guy, Jon, Ann, Jim, Eva, Amy, Tim, Ron, Kim, Tom, Roy, Kay, Dot