tune: Brown-eyed Girl, Van Morrison

My Tree Pointer

Hey where'd my info go?
The node I just created.
Goin' down my search tree
order n in the worst case
Order logn-ing away hey
as seen on average.
Until it finds a null pointer
now its address is xz36o8.

my Tree pointer
you my Tree Pointer

And whatever happened
to the tvectors I used to know?
Got replaced by new ADTs because
their search functions were too slow.
Inserting and deleting were fine
I'd pop it back or push it on.
But now I have to think about time
and write so many recursive functions.

with Tree pointers
you my Tree pointers

now I can tell which way my info goes
left left right right left left right left right right right left right 
(let's backtrack)
left left right right left left right left right right right left
right
left left right

So hard to find my bug
in my new recursive code.
My function will work with a loop?
Wish i'd known that a week ago.
But it really doesn't matter
if I use tvectors, trees, maps, or what.
I know for sure when I run my program
I'm going to get a segmentation fault.

with Tree pointers
don't you love Tree pointers?

even with an empty tree, my code prints out
left left right right left left right left right right right left right
left left right right left left right left right right right left right
(why why why why why why why why why......)
left left right right left left right left right right right left right