> print

E

// Its the empty tree.
>
> insert AAA

// AAA goes into the root node

> remove AAA

// Now we take it out, successfully

> remove   B

// Its not there, need to indicate that

> print

E

// empty again

>
>insert  A

// Insert A into the root

>insert AA

// Cause root to split, and then split the A branch again.

>insert CGA

// It goes into the C branch

>print

I
  I
    AA
    E
    E
    E
    A
  CGA
  E
  E
  E

> print  lengths

I
  I
    AA 2
    E
    E
    E
    A 1
  CGA 3
  E
  E
  E

> print stats

I
  I
    AA A 100%, C 0%, G 0%, T 0%
    E
    E
    E
    A A 100%, C 0%, G 0%, T 0%
  CGA A 33.3%, C 33.3%, G 33.3%, T 0%
  E
  E
  E

>         search           A

The following sequences start with A:
A
AA

> search A$

// A is found