Tune: Blessed Union of Soul -- Hey
      Leonardo (She likes me for me)


It don't matter what you are, a vector, pointer, or a string
You'll never be as good as a computer's best friend,
And if you were it wouldn't mean nothin'

She's a balanced search tree, not a bunch of random linked list pointers
or a sorted t vector, ooo that's order n squared
and can't you see, insertion and deletion
and sorting are much faster, than any other method that we've learned

It can take a computer screen, and all the data that it sees
Things like that are never scattered inside her
Plus she don't take that long for me

She don't care that I can sort her, in ways that others never been
If she's feeling really NULL, I think deep down she knows
That, all she has to call is New();

She's a balanced search tree, not because she has a really nice stack
Or her pointer points front and back, tha'd be doubly linked
She's the one for me
And I just can't code without her, my program revolves around her
And I'm so glad she's constructed once again (3)

Gazing at the header, as we entertain our subtrees in the dark
The things that we are made of
are gonna show us what derived us in the end

She's a balanced search tree, not because I really fill her body
with ints and strings and structs called Fooie(), hah
I like her for her, not because she's fast like a hash table
She is ready, willing and able
Why does she waste all her time with me
There must be a private section I don't see,
I don't see

She's a balanced search tree, just because she inserts with a pointer
I don't know what rhymes with pointer, unlike the word Trie
But what I see, is that I can't code without her
My main() revolves around her
And I'm so glad I wrote her once again, wrote her once again
And I'm so glad I wrote her once again