1.
tree height = 4 (count edges, not nodes)
height(A) = 3    height(K) = 1
bal(A) = 1, bal(D) = 2, bal( J ) = 0

2.
1+2+4+...2^h = 2^(h+1) -1
h+1
                 3^(h+1) -1
1+3+9+...+3^h = -----------
                     3-1
number of leaves 
2^h
3^h

N-1 - linked list
log N

6.
G - 0
D - 1
A - 2
E - 0
F - 0
K - 0
Q - 1

           K
         /   \
         Q    F
        / \
       A   E
      /
     D
    /
   G

       A
      / \ 
     D   Q
    /     \
   G       K
          / \
         E   F
      

11.
        7
       /  \
      2    9
       \   /
        5  8
       / \
       4  6    

14.
BuiltTree( int * a, int n ) {
    if ( n==1 ) {
        return new Node( a[0], NULL, NULL ); // data, left, right
    }

    return new Node( 
            a[n/2], 
            BuiltTree( a, n/2 ), 
            BuiltTree( a+n/2+1, n-n/2 -1 ) 
            );
}