BST(sorted)  Insert   63   values  short:    4 long: 36   average:   13
BBST(sorted) Search   63   values  short:    1 long: 7    average:    3
BST Height: 63, max nodes: 4294967295  usage: 0.000001 


BST(random) Insert   63   values  short:    4 long: 39   average:    5
BST(random) Search   63   values  short:    0 long: 2    average:    1
BST Height: 9, max nodes: 511  usage: 12.328767 


NOTE: 
binary search tree is TERRIBLE for sorted data , this sample size is pretty low so that we 
can look at a visual representation and have it look like something we can see. the search time is 3 times larger here 
for sorted versus random

With random data we will get a somewhat evenly distributed tree.  were we can search 63 values with 9 comparisons
not a bad way to go






AVL(sorted) Insert   63   values  short:    6 long: 61   average:   29
AVL(sorted) Search   63   values  short:    0 long: 9    average:    1
AVL Height: 6, max nodes: 63  usage: 100.000000  

AVL(random) Insert   63   values  short:    7 long: 63   average:   29
AVL Random
AVL(random) Search   63   values  short:    0 long: 9    average:    1
AVL Height: 7, max nodes: 127  usage: 49.606299  


NOTE:
Sorted Or Not , the average insertion times for the AVL are higher
The height of the trees created for both sorted and unsorted are shorter than a BST
so slower inserts but faster searches
as N ( number of values ) goes up this will become more pronouned.



here we are inserting 2047 values

BST(sorted) Insert   2047 values  short:    4 long: 552  average:  275
BST(sorted) Search   2047 values  short:    1 long: 226  average:  109
BST Height: 2047, max nodes: 4294967295  usage: 0.000048 

BST(random) Insert   2047 values  short:    4 long: 81   average:    7
BST(random) Search   2047 values  short:    0 long: 12   average:    1
BST Height: 24, max nodes: 16777215  usage: 0.012201 

AVL(sorted) Insert   2047 values  short:    7 long: 1407 average:  708
AVL(sorted) Search   2047 values  short:    0 long: 12   average:    1
AVL Height: 11, max nodes: 2047  usage: 100.000000  

AVL(random) Insert   2047 values  short:    6 long: 1602 average:  723
AVL(random) Search   2047 values  short:    0 long: 11   average:    1
AVL Height: 13, max nodes: 8191  usage: 24.990844  










SLL Insert Front     63   values  short:    3 long: 43   average:    4
SLL Insert Back      63   values  short:    4 long: 31   average:    6
SLL Search      63   values  short:    0 long: 8    average:    3
DLL Insert Front     63   values  short:    3 long: 44   average:    4
DLL Insert Back      63   values  short:    3 long: 17   average:    4
DLL Search      63   values  short:    1 long: 16   average:    3