1) Draw a binary search tree whose preorder traversal is 60, 30, 10, 0, 20, 50, 40, 90, 70, 80, 100

2) Draw the min-ordered heap that results from using the bottom-up heap building method. Start with an initial array containing the values: 50, 75, 25, 40, 10, 90, 60, 80, 30, 70, 20.