In a binary search tree, when an entry is added, the algorithm starts at the root node, and then moves right if the entry is larger than the current node or left if the entry is smaller than the current node. If there is no node available in the specified direction, the entry is added in that position.

If the number 40 were added to the tree above, what would the new tree look like?

An abstraction of a two-dimensional array structure is shown below; a black square indicates a 1 and a white square indicates a 0.

A loop runs through all entries on row 2 and sets each A[row][column] A[\text{row}][\text{column}] A[row][column] to equal A[row+1][column] A[\text{row} + 1][\text{column}] A[row+1][column]. What will the new array look like?