Consider the following array of integers: [1,2,3,4,5,6,7,8,9,10]. Show
the binary search tree resulting from inserting the integers in the
array.

Consider the following array of integers: [10,9,8,7,6,5,4,3,2,1]. Show
the binary search tree resulting from inserting the integers in the
array.

Generate a random array of integers. Show the binary heap tree
resulting from inserting the integers on the array one at a time.

Using the array from the previous question, show the binary heap tree
resulting from using the array as a parameter to the buildHeap
method. Show both the tree and array form.

Draw the binary search tree that results from inserting the following
keys in the order given: 68,88,61,89,94,50,4,76,66, and 82.

Generate a random array of integers. Draw the binary search tree
resulting from inserting the integers on the array.

Consider the following array 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.

Consider the following array of integers: [10,9,8,7,6,5,4,3,2,1]. Show
the binary heap resulting from inserting the integers one at a time.

Consider the two different techniques we used for implementing traversals of a binary
tree. Why must we check before the call to preorder when
implementing as a method, whereas we could check inside the call when
implementing as a function?

Show the function calls needed to build the following binary tree.

Given the following tree, perform the appropriate rotations to bring it back into balance.

Using the following as a starting point, derive the equation that gives the updated balance factor for node D.