((((14:0:1)15:2:4((17:0:1)19:1:2))20:3:8((30:0:1)31:1:3(32:0:1)))33:4:18(((34:0:1)38:1:3(40:0:1))41:3:9(((43:0:1)70:1:2)81:2:5(95:1:2(110:0:1))))) First a small test... Node report on position LLL : key = 14 height = 0 size = 1 no left child no right child Node report on position LLRL : key = 17 height = 0 size = 1 no left child no right child Node report on position LLR : key = 19 height = 1 size = 2 left child key = 17 no right child Node report on position LL : key = 15 height = 2 size = 4 left child key = 14 right child key = 19 Node report on position LRL : key = 30 height = 0 size = 1 no left child no right child Node report on position LRR : key = 32 height = 0 size = 1 no left child no right child Node report on position LR : key = 31 height = 1 size = 3 left child key = 30 right child key = 32 Node report on position L : key = 20 height = 3 size = 8 left child key = 15 right child key = 31 Node report on position RLL : key = 34 height = 0 size = 1 no left child no right child Node report on position RLR : key = 40 height = 0 size = 1 no left child no right child Node report on position RL : key = 38 height = 1 size = 3 left child key = 34 right child key = 40 Node report on position RRLL : key = 43 height = 0 size = 1 no left child no right child Node report on position RRL : key = 70 height = 1 size = 2 left child key = 43 no right child Node report on position RRRR : key = 110 height = 0 size = 1 no left child no right child Node report on position RRR : key = 95 height = 1 size = 2 no left child right child key = 110 Node report on position RR : key = 81 height = 2 size = 5 left child key = 70 right child key = 95 Node report on position R : key = 41 height = 3 size = 9 left child key = 38 right child key = 81 Node report on position : key = 33 height = 4 size = 18 left child key = 20 right child key = 41 Small tree has root with key=33, height=4, size=18 Now a big test... Big tree has root with key=2974, height=14, size=5050