creating tree… inserting 11… (1) 11 inserting 11… R-(1) 11 | (1) 11 inserting 30… R-(1) 30 | (2) 11 | L-(1) 11 inserting 30… R-(1) 30 | R-(1) 30 | (2) 11 | L-(1) 11 inserting 13… R-(1) 30 | R-(2) 30 | | | L-(1) 13 | (2) 11 | L-(1) 11 inserting 2… R-(1) 30 | R-(2) 30 | | | L-(1) 13 | (2) 11 | | R-(1) 11 | | L-(1) 2 inserting 26… R-(1) 30 | R-(2) 30 | | | | R-(1) 26 | | | | L-(1) 13 | (2) 11 | | R-(1) 11 | | L-(1) 2 inserting 21… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | (3) 21 | | R-(1) 13 | | L-(2) 11 | | R-(1) 11 | | L-(1) 2 inserting 6… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | (3) 21 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(2) 6 | L-(1) 2 inserting 8… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | (3) 21 | | R-(1) 13 | | | R-(2) 11 | | | | | | R-(1) 11 | | | | | | L-(1) 8 | | L-(2) 6 | L-(1) 2 inserting 17… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | (3) 21 | | R-(1) 17 | | | R-(1) 13 | | | R-(2) 11 | | | | | | R-(1) 11 | | | | | | L-(1) 8 | | L-(2) 6 | L-(1) 2 inserting 4… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | (3) 21 | | R-(1) 17 | | | R-(1) 13 | | | R-(2) 11 | | | | | | R-(1) 11 | | | | | | L-(1) 8 | | L-(2) 6 | | R-(1) 4 | | L-(1) 2 inserting 7… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 13 | | | | L-(2) 11 | | | L-(1) 11 | (3) 8 | | R-(1) 7 | | L-(2) 6 | | R-(1) 4 | | L-(1) 2 inserting 16… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(2) 16 | | | | | | | L-(1) 13 | | | | L-(2) 11 | | | L-(1) 11 | (3) 8 | | R-(1) 7 | | L-(2) 6 | | R-(1) 4 | | L-(1) 2 inserting 13… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(2) 16 | | | | | | | | R-(1) 13 | | | | | | | | L-(1) 13 | | | | L-(2) 11 | | | L-(1) 11 | (3) 8 | | R-(1) 7 | | L-(2) 6 | | R-(1) 4 | | L-(1) 2 inserting 15… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | L-(2) 16 | | | L-(1) 15 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | L-(2) 6 | | R-(1) 4 | | L-(1) 2 inserting 13… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | L-(2) 16 | | | | R-(1) 15 | | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | L-(2) 6 | | R-(1) 4 | | L-(1) 2 inserting 5… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | L-(2) 16 | | | | R-(1) 15 | | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | | R-(2) 6 | | | | | L-(1) 5 | | L-(2) 4 | L-(1) 2 inserting 1… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | L-(2) 16 | | | | R-(1) 15 | | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | | R-(2) 6 | | | | | L-(1) 5 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 inserting 16… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | | R-(1) 15 | | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | | R-(2) 6 | | | | | L-(1) 5 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 breaking invariant 1… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | | R-(1) 15 | | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | | R-(2) 6 | | | | | L-(1) 5 | | L-(2) 4 | | R-(7) 2 | | L-(1) 1 FAIL: 1. The level of every leaf node is one. breaking invariant 2… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | | R-(1) 15 | | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(4) 8 | | R-(1) 7 | | | R-(2) 6 | | | | | L-(1) 5 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 FAIL: 2. The level of every left child is exactly one less than that of its parent. breaking invariant 3… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(2) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | | R-(1) 15 | | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | | R-(2) 6 | | | | | L-(1) 5 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 FAIL: 3. The level of every right child is equal to or one less than that of its parent. breaking invariant 4… R-(1) 30 | R-(1) 30 | R-(1) 21 | (1) 13 FAIL: 4. The level of every right grandchild is strictly less than that of its grandparent. breaking invariant 5… R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | | R-(1) 15 | | | | L-(1) 13 | (4) 13 FAIL: 5. Every node of level greater than one has two children. finding node with value 16… found value: 16 R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | | R-(1) 15 | | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | | R-(2) 6 | | | | | L-(1) 5 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 count before: 20 deleting 15… removed count after: 19 R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | | R-(2) 6 | | | | | L-(1) 5 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 count before: 19 deleting 20… not found count after: 19 R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | | R-(2) 6 | | | | | L-(1) 5 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 count before: 19 deleting 5… removed count after: 18 R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | L-(1) 13 | (4) 13 | | R-(1) 13 | | | R-(2) 11 | | | | | L-(1) 11 | | L-(3) 8 | | R-(1) 7 | | | R-(1) 6 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 count before: 18 deleting 13… removed count after: 17 R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | L-(1) 13 | (3) 13 | | R-(1) 11 | | | R-(1) 11 | | | R-(2) 8 | | | | | | R-(1) 7 | | | | | | L-(1) 6 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 count before: 17 deleting 13… removed count after: 16 R-(1) 30 | R-(2) 30 | | | L-(1) 26 | R-(3) 21 | | | | R-(1) 17 | | | | | R-(1) 16 | | | | L-(2) 16 | | | L-(1) 13 | (3) 11 | | R-(1) 11 | | | R-(2) 8 | | | | | | R-(1) 7 | | | | | | L-(1) 6 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 count before: 16 deleting 26… removed count after: 15 R-(1) 30 | R-(1) 30 | R-(2) 21 | | | | R-(1) 17 | | | | L-(1) 16 | R-(2) 16 | | | L-(1) 13 | (3) 11 | | R-(1) 11 | | | R-(2) 8 | | | | | | R-(1) 7 | | | | | | L-(1) 6 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 count before: 15 deleting 3… not found count after: 15 R-(1) 30 | R-(1) 30 | R-(2) 21 | | | | R-(1) 17 | | | | L-(1) 16 | R-(2) 16 | | | L-(1) 13 | (3) 11 | | R-(1) 11 | | | R-(2) 8 | | | | | | R-(1) 7 | | | | | | L-(1) 6 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 count before: 15 deleting 10… not found count after: 15 R-(1) 30 | R-(1) 30 | R-(2) 21 | | | | R-(1) 17 | | | | L-(1) 16 | R-(2) 16 | | | L-(1) 13 | (3) 11 | | R-(1) 11 | | | R-(2) 8 | | | | | | R-(1) 7 | | | | | | L-(1) 6 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 count before: 15 deleting 12… not found count after: 15 R-(1) 30 | R-(1) 30 | R-(2) 21 | | | | R-(1) 17 | | | | L-(1) 16 | R-(2) 16 | | | L-(1) 13 | (3) 11 | | R-(1) 11 | | | R-(2) 8 | | | | | | R-(1) 7 | | | | | | L-(1) 6 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 count before: 15 deleting 12… not found count after: 15 R-(1) 30 | R-(1) 30 | R-(2) 21 | | | | R-(1) 17 | | | | L-(1) 16 | R-(2) 16 | | | L-(1) 13 | (3) 11 | | R-(1) 11 | | | R-(2) 8 | | | | | | R-(1) 7 | | | | | | L-(1) 6 | | L-(2) 4 | | R-(1) 2 | | L-(1) 1 iterating tree… 1 2 4 6 7 8 11 11 13 16 16 17 21 30 30 exit-code: 0