;; insertion
5 6 7 8 9 10 11
1 2 3 4 5 6 7 8 9 10 11

;; initial population for upcoming tests
1 2 3 4 5 6 7 8 9

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

;; iteration
1 2 3 4 5 6 7 8 9
9 8 7 6 5 4 3 2 1

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

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

;; join
11 12 13
(no key)
1 2 3 4 5 6 7 8 9 11 12 13
11 12 13
10
1 2 3 4 5 6 7 8 9 10 11 12 13
11
10
1 2 3 4 5 6 7 8 9 10 11
(empty tree)
10
1 2 3 4 5 6 7 8 9 10
(empty tree)
(no key)
1 2 3 4 5 6 7 8 9
11 12 13 14 15 16 17 18 19 20
10
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 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 #0x000000af 16> #<link node #0x000000af 16 right -> node #0x000000ae 24> #<link node #0x000000ae 24 left -> node #0x000000a6 20> #<link node #0x000000a6 20 left -> node #0x000000a2 18>)
19 20 21 22 23 24 25 26 27 28 29 30 31
18
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
(#<link root -> node #0x000000ce 16> #<link node #0x000000ce 16 right -> node #0x000000cd 24> #<link node #0x000000cd 24 left -> node #0x000000c5 20> #<link node #0x000000c5 20 left -> node #0x000000c1 18> #<link node #0x000000c1 18 left -> node #0x000000bf 17> #<link node #0x000000bf 17 right -> (nil)>)
18 19 20 21 22 23 24 25 26 27 28 29 30 31
(empty tree)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
(#<link root -> node #0x000000ed 16> #<link node #0x000000ed 16 right -> node #0x000000ec 24> #<link node #0x000000ec 24 left -> node #0x000000e4 20> #<link node #0x000000e4 20 left -> node #0x000000e0 18> #<link node #0x000000e0 18 right -> node #0x000000df 19> #<link node #0x000000df 19 left -> (nil)>)
19 20 21 22 23 24 25 26 27 28 29 30 31
(empty tree)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
17
(#<link root -> node #0x0000010c 16> #<link node #0x0000010c 16 right -> node #0x0000010b 24> #<link node #0x0000010b 24 left -> node #0x00000103 20> #<link node #0x00000103 20 left -> node #0x000000ff 18> #<link node #0x000000ff 18 left -> (nil)>)
18 19 20 21 22 23 24 25 26 27 28 29 30 31
(empty tree)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
19
(#<link root -> node #0x0000012b 16> #<link node #0x0000012b 16 right -> node #0x0000012a 24> #<link node #0x0000012a 24 left -> node #0x00000122 20> #<link node #0x00000122 20 left -> node #0x0000011e 18> #<link node #0x0000011e 18 right -> (nil)>)
20 21 22 23 24 25 26 27 28 29 30 31
(empty tree)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

;; set ops
1 3 5 7 9 11 13 15
2 3 6 7 10 11 14 15
union
1 2 3 5 6 7 9 10 11 13 14 15
intersection
3 7 11 15
a
1 3 5 7 9 11 13 15
b
2 3 6 7 10 11 14 15
difference
2 6 10 14
intersection
3 7 11 15
a original
1 3 5 7 9 11 13 15

;; clear everything.

;;;----- That's all, folks -------------------------------------------------