Problem
1. Generate a random list of integers. Draw the binary search tree resulting from inserting the integers on the list.
2. Consider the following list of integers: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]. Show the binary heap resulting from inserting the integers one at a time.