;; insertion
tree dump, ht = 3
	#0x00000000 (n =   1)	        (=) 5
	#0x00000001 (n =   3)	    (=) 6
	#0x00000002 (n =   1)	        (=) 7
	#0x00000003 (n =   7)	(=) 8
	#0x00000004 (n =   1)	        (=) 9
	#0x00000005 (n =   3)	    (=) 10
	#0x00000006 (n =   1)	        (=) 11
tree dump, ht = 4
	#0x00000007 (n =   1)	        (=) 1
	#0x00000008 (n =   4)	    (+) 2
	#0x00000009 (n =   2)	        (+) 3
	#0x0000000a (n =   1)	            (=) 4
	#0x00000000 (n =  11)	(=) 5
	#0x00000001 (n =   2)	        (+) 6
	#0x00000002 (n =   1)	            (=) 7
	#0x00000003 (n =   6)	    (=) 8
	#0x00000004 (n =   1)	            (=) 9
	#0x00000005 (n =   3)	        (=) 10
	#0x00000006 (n =   1)	            (=) 11
;; initial population for upcoming tests
tree dump, ht = 4
	#0x0000000b (n =   1)	        (=) 1
	#0x0000000c (n =   3)	    (=) 2
	#0x0000000d (n =   1)	        (=) 3
	#0x0000000e (n =   9)	(+) 4
	#0x0000000f (n =   1)	        (=) 5
	#0x00000010 (n =   5)	    (+) 6
	#0x00000011 (n =   1)	            (=) 7
	#0x00000012 (n =   3)	        (=) 8
	#0x00000013 (n =   1)	            (=) 9

;; lookup
#<node #0x0000000f 5>
(nil)

;; path motion
(#<link root -> node #0x00000014 4> #<link node #0x00000014 4 left -> node #0x00000015 2> #<link node #0x00000015 2 left -> node #0x00000016 1>)
1
(#<link root -> node #0x00000014 4> #<link node #0x00000014 4 left -> node #0x00000015 2>)
2
(#<link root -> node #0x00000014 4> #<link node #0x00000014 4 left -> node #0x00000015 2> #<link node #0x00000015 2 right -> node #0x00000017 3>)
3
(#<link root -> node #0x00000014 4>)
4
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 right -> node #0x0000001a 8> #<link node #0x0000001a 8 right -> node #0x0000001c 9>)
9
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 right -> node #0x0000001a 8>)
8
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 right -> node #0x0000001a 8> #<link node #0x0000001a 8 left -> node #0x00000018 6> #<link node #0x00000018 6 right -> node #0x0000001b 7>)
7
(#<link root -> node #0x00000019 5>)
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 left -> node #0x00000015 2> #<link node #0x00000015 2 right -> node #0x00000017 3>)
3
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 left -> node #0x00000015 2> #<link node #0x00000015 2 right -> node #0x00000017 3> #<link node #0x00000017 3 right -> (nil)>)
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 left -> node #0x00000015 2> #<link node #0x00000015 2 right -> node #0x00000017 3>)
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 left -> node #0x00000015 2> #<link node #0x00000015 2 right -> node #0x00000017 3> #<link node #0x00000017 3 right -> (nil)>)
(#<link root -> node #0x00000019 5>)
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 left -> node #0x00000015 2> #<link node #0x00000015 2 left -> node #0x00000016 1> #<link node #0x00000016 1 left -> (nil)>)
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 left -> node #0x00000015 2> #<link node #0x00000015 2 left -> node #0x00000016 1>)
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 right -> node #0x0000001a 8> #<link node #0x0000001a 8 right -> node #0x0000001c 9> #<link node #0x0000001c 9 right -> (nil)>)
(#<link root -> node #0x00000019 5> #<link node #0x00000019 5 right -> node #0x0000001a 8> #<link node #0x0000001a 8 right -> node #0x0000001c 9>)

;; remove
7
6
4
1
5
2
3
8
9
(empty tree)

;; join
1 2 3 4 5 6 7 8 9
11 12 13
(no key)
tree dump, ht = 4
	#0x00000028 (n =   1)	            (=) 1
	#0x00000027 (n =   3)	        (=) 2
	#0x00000029 (n =   1)	            (=) 3
	#0x00000026 (n =   5)	    (-) 4
	#0x0000002b (n =   1)	        (=) 5
	#0x0000002a (n =  12)	(=) 6
	#0x0000002d (n =   1)	            (=) 7
	#0x0000002c (n =   3)	        (=) 8
	#0x0000002e (n =   1)	            (=) 9
	#0x0000002f (n =   6)	    (=) 11
	#0x00000031 (n =   2)	        (+) 12
	#0x00000030 (n =   1)	            (=) 13
1 2 3 4 5 6 7 8 9
11 12 13
10
tree dump, ht = 4
	#0x00000034 (n =   1)	            (=) 1
	#0x00000033 (n =   3)	        (=) 2
	#0x00000035 (n =   1)	            (=) 3
	#0x00000032 (n =   5)	    (-) 4
	#0x00000037 (n =   1)	        (=) 5
	#0x00000036 (n =  13)	(=) 6
	#0x00000039 (n =   1)	            (=) 7
	#0x00000038 (n =   3)	        (=) 8
	#0x0000003a (n =   1)	            (=) 9
	#0x0000003e (n =   7)	    (=) 10
	#0x0000003b (n =   1)	            (=) 11
	#0x0000003d (n =   3)	        (=) 12
	#0x0000003c (n =   1)	            (=) 13
1 2 3 4 5 6 7 8 9
11
10
tree dump, ht = 4
	#0x00000041 (n =   1)	        (=) 1
	#0x00000040 (n =   3)	    (=) 2
	#0x00000042 (n =   1)	        (=) 3
	#0x0000003f (n =  11)	(+) 4
	#0x00000044 (n =   1)	            (=) 5
	#0x00000043 (n =   3)	        (=) 6
	#0x00000046 (n =   1)	            (=) 7
	#0x00000045 (n =   7)	    (=) 8
	#0x00000047 (n =   1)	            (=) 9
	#0x00000049 (n =   3)	        (=) 10
	#0x00000048 (n =   1)	            (=) 11
1 2 3 4 5 6 7 8 9
(empty tree)
10
tree dump, ht = 4
	#0x0000004c (n =   1)	        (=) 1
	#0x0000004b (n =   3)	    (=) 2
	#0x0000004d (n =   1)	        (=) 3
	#0x0000004a (n =  10)	(+) 4
	#0x0000004f (n =   1)	            (=) 5
	#0x0000004e (n =   3)	        (=) 6
	#0x00000051 (n =   1)	            (=) 7
	#0x00000050 (n =   6)	    (=) 8
	#0x00000052 (n =   2)	        (+) 9
	#0x00000053 (n =   1)	            (=) 10
1 2 3 4 5 6 7 8 9
(empty tree)
(no key)
tree dump, ht = 4
	#0x00000056 (n =   1)	        (=) 1
	#0x00000055 (n =   3)	    (=) 2
	#0x00000057 (n =   1)	        (=) 3
	#0x00000054 (n =   9)	(+) 4
	#0x00000059 (n =   1)	        (=) 5
	#0x00000058 (n =   5)	    (+) 6
	#0x0000005b (n =   1)	            (=) 7
	#0x0000005a (n =   3)	        (=) 8
	#0x0000005c (n =   1)	            (=) 9
1 2 3 4 5 6 7 8 9
11 12 13 14 15 16 17 18 19 20
10
tree dump, ht = 5
	#0x0000005f (n =   1)	            (=) 1
	#0x0000005e (n =   3)	        (=) 2
	#0x00000060 (n =   1)	            (=) 3
	#0x0000005d (n =   9)	    (+) 4
	#0x00000062 (n =   1)	            (=) 5
	#0x00000061 (n =   5)	        (+) 6
	#0x00000064 (n =   1)	                (=) 7
	#0x00000063 (n =   3)	            (=) 8
	#0x00000065 (n =   1)	                (=) 9
	#0x00000070 (n =  20)	(=) 10
	#0x00000066 (n =   1)	            (=) 11
	#0x00000067 (n =   3)	        (=) 12
	#0x00000068 (n =   1)	            (=) 13
	#0x00000069 (n =  10)	    (+) 14
	#0x0000006a (n =   1)	                (=) 15
	#0x0000006b (n =   3)	            (=) 16
	#0x0000006c (n =   1)	                (=) 17
	#0x0000006d (n =   6)	        (=) 18
	#0x0000006e (n =   2)	            (+) 19
	#0x0000006f (n =   1)	                (=) 20

;; split
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
(#<link root -> node #0x00000080 16> #<link node #0x00000080 16 right -> node #0x00000088 24> #<link node #0x00000088 24 left -> node #0x00000084 20> #<link node #0x00000084 20 left -> node #0x00000082 18>)
tree dump, ht = 4
	#0x00000083 (n =   1)	        (=) 19
	#0x00000084 (n =   5)	    (+) 20
	#0x00000085 (n =   1)	            (=) 21
	#0x00000086 (n =   3)	        (=) 22
	#0x00000087 (n =   1)	            (=) 23
	#0x00000088 (n =  13)	(=) 24
	#0x00000089 (n =   1)	            (=) 25
	#0x0000008a (n =   3)	        (=) 26
	#0x0000008b (n =   1)	            (=) 27
	#0x0000008c (n =   7)	    (=) 28
	#0x0000008d (n =   1)	            (=) 29
	#0x0000008e (n =   3)	        (=) 30
	#0x0000008f (n =   1)	            (=) 31
tree dump, ht = 1
	#0x00000082 (n =   1)	(=) 18
tree dump, ht = 5
	#0x00000071 (n =   1)	            (=) 1
	#0x00000072 (n =   3)	        (=) 2
	#0x00000073 (n =   1)	            (=) 3
	#0x00000074 (n =   7)	    (=) 4
	#0x00000075 (n =   1)	            (=) 5
	#0x00000076 (n =   3)	        (=) 6
	#0x00000077 (n =   1)	            (=) 7
	#0x00000078 (n =  17)	(+) 8
	#0x00000079 (n =   1)	            (=) 9
	#0x0000007a (n =   3)	        (=) 10
	#0x0000007b (n =   1)	            (=) 11
	#0x0000007c (n =   9)	    (+) 12
	#0x0000007d (n =   1)	            (=) 13
	#0x0000007e (n =   5)	        (+) 14
	#0x0000007f (n =   1)	                (=) 15
	#0x00000080 (n =   3)	            (=) 16
	#0x00000081 (n =   1)	                (=) 17
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 18 19 20 21 22 23 24 25 26 27 28 29 30 31
(#<link root -> node #0x0000009f 16> #<link node #0x0000009f 16 right -> node #0x000000a7 24> #<link node #0x000000a7 24 left -> node #0x000000a3 20> #<link node #0x000000a3 20 left -> node #0x000000a1 18> #<link node #0x000000a1 18 left -> (nil)>)
tree dump, ht = 4
	#0x000000a1 (n =   2)	        (+) 18
	#0x000000a2 (n =   1)	            (=) 19
	#0x000000a3 (n =   6)	    (=) 20
	#0x000000a4 (n =   1)	            (=) 21
	#0x000000a5 (n =   3)	        (=) 22
	#0x000000a6 (n =   1)	            (=) 23
	#0x000000a7 (n =  14)	(=) 24
	#0x000000a8 (n =   1)	            (=) 25
	#0x000000a9 (n =   3)	        (=) 26
	#0x000000aa (n =   1)	            (=) 27
	#0x000000ab (n =   7)	    (=) 28
	#0x000000ac (n =   1)	            (=) 29
	#0x000000ad (n =   3)	        (=) 30
	#0x000000ae (n =   1)	            (=) 31
tree dump, ht = 0
	(tree empty)
tree dump, ht = 5
	#0x00000090 (n =   1)	            (=) 1
	#0x00000091 (n =   3)	        (=) 2
	#0x00000092 (n =   1)	            (=) 3
	#0x00000093 (n =   7)	    (=) 4
	#0x00000094 (n =   1)	            (=) 5
	#0x00000095 (n =   3)	        (=) 6
	#0x00000096 (n =   1)	            (=) 7
	#0x00000097 (n =  16)	(+) 8
	#0x00000098 (n =   1)	            (=) 9
	#0x00000099 (n =   3)	        (=) 10
	#0x0000009a (n =   1)	            (=) 11
	#0x0000009b (n =   8)	    (+) 12
	#0x0000009c (n =   1)	            (=) 13
	#0x0000009d (n =   4)	        (+) 14
	#0x0000009e (n =   2)	            (+) 15
	#0x0000009f (n =   1)	                (=) 16
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 22 23 24 25 26 27 28 29 30 31
(#<link root -> node #0x000000be 16> #<link node #0x000000be 16 right -> node #0x000000c6 24> #<link node #0x000000c6 24 left -> node #0x000000c2 20> #<link node #0x000000c2 20 left -> node #0x000000c0 18> #<link node #0x000000c0 18 right -> (nil)>)
tree dump, ht = 4
	#0x000000c2 (n =   1)	            (=) 20
	#0x000000c3 (n =   2)	        (-) 21
	#0x000000c4 (n =   4)	    (-) 22
	#0x000000c5 (n =   1)	        (=) 23
	#0x000000c6 (n =  12)	(=) 24
	#0x000000c7 (n =   1)	            (=) 25
	#0x000000c8 (n =   3)	        (=) 26
	#0x000000c9 (n =   1)	            (=) 27
	#0x000000ca (n =   7)	    (=) 28
	#0x000000cb (n =   1)	            (=) 29
	#0x000000cc (n =   3)	        (=) 30
	#0x000000cd (n =   1)	            (=) 31
tree dump, ht = 0
	(tree empty)
tree dump, ht = 5
	#0x000000af (n =   1)	            (=) 1
	#0x000000b0 (n =   3)	        (=) 2
	#0x000000b1 (n =   1)	            (=) 3
	#0x000000b2 (n =   7)	    (=) 4
	#0x000000b3 (n =   1)	            (=) 5
	#0x000000b4 (n =   3)	        (=) 6
	#0x000000b5 (n =   1)	            (=) 7
	#0x000000b6 (n =  18)	(+) 8
	#0x000000b7 (n =   1)	            (=) 9
	#0x000000b8 (n =   3)	        (=) 10
	#0x000000b9 (n =   1)	            (=) 11
	#0x000000ba (n =  10)	    (+) 12
	#0x000000bb (n =   1)	                (=) 13
	#0x000000bc (n =   3)	            (=) 14
	#0x000000bd (n =   1)	                (=) 15
	#0x000000be (n =   6)	        (=) 16
	#0x000000bf (n =   1)	                (=) 17
	#0x000000c0 (n =   2)	            (-) 18

;; set ops
1 3 5 7 9 11 13 15
2 3 6 7 10 11 14 15
union
tree dump, ht = 4
	#0x000000ce (n =   2)	        (+) 1
	#0x000000d6 (n =   1)	            (=) 2
	#0x000000cf (n =   5)	    (=) 3
	#0x000000d0 (n =   2)	        (+) 5
	#0x000000d8 (n =   1)	            (=) 6
	#0x000000d1 (n =  12)	(=) 7
	#0x000000d2 (n =   2)	        (+) 9
	#0x000000da (n =   1)	            (=) 10
	#0x000000d3 (n =   6)	    (=) 11
	#0x000000d4 (n =   1)	            (=) 13
	#0x000000dc (n =   3)	        (=) 14
	#0x000000d5 (n =   1)	            (=) 15
intersection
tree dump, ht = 3
	#0x000000d7 (n =   1)	    (=) 3
	#0x000000d9 (n =   4)	(+) 7
	#0x000000db (n =   2)	    (+) 11
	#0x000000dd (n =   1)	        (=) 15
a
1 3 5 7 9 11 13 15
b
2 3 6 7 10 11 14 15
difference
tree dump, ht = 3
	#0x000000e6 (n =   1)	        (=) 2
	#0x000000e8 (n =   2)	    (-) 6
	#0x000000ea (n =   4)	(-) 10
	#0x000000ec (n =   1)	    (=) 14
intersection
tree dump, ht = 3
	#0x000000e7 (n =   1)	    (=) 3
	#0x000000e9 (n =   4)	(+) 7
	#0x000000eb (n =   2)	    (+) 11
	#0x000000ed (n =   1)	        (=) 15
a original
tree dump, ht = 4
	#0x000000de (n =   1)	        (=) 1
	#0x000000df (n =   3)	    (=) 3
	#0x000000e0 (n =   1)	        (=) 5
	#0x000000e1 (n =   8)	(+) 7
	#0x000000e2 (n =   1)	        (=) 9
	#0x000000e3 (n =   4)	    (+) 11
	#0x000000e4 (n =   2)	        (+) 13
	#0x000000e5 (n =   1)	            (=) 15

;; clear everything.