(((((14:0:1)15:1:3(17:0:1))19:2:4)20:3:5)30:6:18((31:0:1)32:5:12((33:2:3(34:1:2(38:0:1)))40:4:10((41:1:2(43:0:1))70:3:6((81:1:2(95:0:1))110:2:3)))))
First a small test...

Node report on position LLLL :
   key = 14   height = 0   size = 1
   no left child
   no right child

Node report on position LLLR :
   key = 17   height = 0   size = 1
   no left child
   no right child

Node report on position LLL :
   key = 15   height = 1   size = 3
   left child key = 14
   right child key = 17

Node report on position LL :
   key = 19   height = 2   size = 4
   left child key = 15
   no right child

Node report on position L :
   key = 20   height = 3   size = 5
   left child key = 19
   no right child

Node report on position RL :
   key = 31   height = 0   size = 1
   no left child
   no right child

Node report on position RRLRR :
   key = 38   height = 0   size = 1
   no left child
   no right child

Node report on position RRLR :
   key = 34   height = 1   size = 2
   no left child
   right child key = 38

Node report on position RRL :
   key = 33   height = 2   size = 3
   no left child
   right child key = 34

Node report on position RRRLR :
   key = 43   height = 0   size = 1
   no left child
   no right child

Node report on position RRRL :
   key = 41   height = 1   size = 2
   no left child
   right child key = 43

Node report on position RRRRLR :
   key = 95   height = 0   size = 1
   no left child
   no right child

Node report on position RRRRL :
   key = 81   height = 1   size = 2
   no left child
   right child key = 95

Node report on position RRRR :
   key = 110   height = 2   size = 3
   left child key = 81
   no right child

Node report on position RRR :
   key = 70   height = 3   size = 6
   left child key = 41
   right child key = 110

Node report on position RR :
   key = 40   height = 4   size = 10
   left child key = 33
   right child key = 70

Node report on position R :
   key = 32   height = 5   size = 12
   left child key = 31
   right child key = 40

Node report on position  :
   key = 30   height = 6   size = 18
   left child key = 20
   right child key = 32


Small tree has root with key=30, height=6, size=18
Passed check against STL set S
***** ExpBST Report
   size = 18
   height = 6
   height/log(size) = 1.43887
   numRebalance = 2
   failedRebalance = 0
   exceedsHeight = 0
   maxRebalanceDepth = 3
   minRebalanceHeight = 5
   rebalanceFactor = 1.5


Now a big test...


Big tree has root with key=1404, height=21, size=3800
Passed check against STL set S2
***** ExpBST Report
   size = 3800
   height = 21
   height/log(size) = 1.76593
   numRebalance = 2523
   failedRebalance = 0
   exceedsHeight = 0
   maxRebalanceDepth = 3
   minRebalanceHeight = 5
   rebalanceFactor = 2