Draw binary search trees (BST) of heights 2, 3, 4, 5, and 6, using a set of {1,5,7,13,22,28,39}. Which of your trees result in best-case for binary search and worst-case for binary search? What are the expected running times for those scenarios? Tip: all trees should be constructed using the same set of numbers.

Please don't post the same response answered earlier.