--TESTS FROM ASSIGNMENT SHEET--
Creating data nodes:
OUTPUT: data node=([2, 1], [4, 2])
OUTPUT: data node=([6, 3], [8, 4])
OUTPUT: data node=([10, 5], null)
OUTPUT: data node=([12, 6], [14, 7])
OUTPUT: data node=([16, 8], null)

Creating index nodes:
TRACE:  minD=[6, 3]. minD=[10, 5]. 
OUTPUT: index node keys=(6, 10)
TRACE:  minD=[16, 8]. null.
OUTPUT: index node keys=(16, null)
TRACE:  minI=16, minD=[12, 6]. null.
OUTPUT: index node keys=(12, null)

Finding:
TRACE:  I: 14>=12. (14<@null). I: 14<16. D: 14>[12, 6], 14=[14, 7]. 
OUTPUT: 14 found in data node=([12, 6], [14, 7]), value=7
TRACE:  I: 11<12. I: 11>=6. 11>=10. D: 11>[10, 5], 11@null.
OUTPUT: 11 not found in data node=([10, 5], null)

Testing ordering within nodes:
OUTPUT: data keys not in order (but constructor will order them)
OUTPUT: data node=([15, 10], [17, 9])
OUTPUT: data node=([15, 11], [17, 12])
OUTPUT: data nodes not in order (but constructor will order them)
TRACE:  minD=[16, 8]. null.
OUTPUT: index node keys=(16, null)

Printing:
OUTPUT: 2 4 6 8 10 12 14 16 


--EXTRA TESTS WITH DIFFERENT DATA TYPE--
Making tree with: [BOB, WILMA, BARNEY, BETTY, FRED, THELMA, SHAGGY, SCOOBY]
Constructed tree contains: 
BARNEY BETTY BOB FRED SCOOBY SHAGGY THELMA WILMA 

Finding "SCOOBY": data node=([SCOOBY, 14.0], [SHAGGY, 15.0])

Finding "SCOOBY" w/ tracing on: 
TRACE:  I: SCOOBY<THELMA. I: SCOOBY>=BOB. SCOOBY>=SCOOBY. D: SCOOBY=[SCOOBY, 14.0]. 
OUTPUT: SCOOBY found in data node=([SCOOBY, 14.0], [SHAGGY, 15.0]), value=14.0
data node=([SCOOBY, 14.0], [SHAGGY, 15.0])

Finding "WILMA" w/ tracing on: 
TRACE:  I: WILMA>=THELMA. (WILMA<@null). I: (WILMA<@null). D: WILMA>[THELMA, 16.0], WILMA=[WILMA, 17.0]. 
OUTPUT: WILMA found in data node=([THELMA, 16.0], [WILMA, 17.0]), value=17.0
data node=([THELMA, 16.0], [WILMA, 17.0])

Tests DONE!