Unbalanced array tree
=====================

       6
     /   \
    -13   14
     \    /\
     -8  13 15
         /
         7

  -------------------------------- -- -------------------------------------------------------------------------------------------------
  ![a small bst](unbalanced.png)      Suppose we store this tree in an array. What is the address of the node containing the value 7?
  -------------------------------- -- -------------------------------------------------------------------------------------------------

a.  A[6]
b.  A[7]
c.  *A[11]*
d.  A[12]

Counting words
==============

Suppose we feed the binary-tree-based word-counting algorithm the
following text:

> The ships hung in the sky\
> in much the same way\
> that bricks don't.

note to self: alphabetizing on board is hard :)

What will be the height of the resulting tree?

a.  3
b.  4
c.  5
d.  6
e.  7

Heap
====

           100
           /  \
         19    36
        / \   /  \
      17   3 25   1
     / \
    2   7

  --------------------------- -- ------------------------------------------------------------------------------------------------
  ![a small heap](heap.png)      In this heap, which pair of values could *not* be swapped without violating the heap property?
  --------------------------- -- ------------------------------------------------------------------------------------------------

a.  19 and 25
b.  3 and 7
c.  *17 and 25*
d.  1 and 2
e.  any of the above could be swapped and the heap property will still
    hold