TREES


We are the world,
We are ROOTS children.
We are the NODES that make up all the TREES so lets start building.

There are many types of TREES,
BST and HUFFMAN,
Us and our parents make up the best ADT's.

We are the world,
We are ROOTS children.
We are the NODES that make up all the TREES so lets start building.

AVL use to be good,
But now RED-BLACK is better,
So we use them to keep ourselves nice and balanced today.

We are the world,
We are ROOTS children.
We are the NODES that make up all the TREES so lets start building.

We have many great uses,
From sorting to compression,
For the first use a B Search Tree, the second a TRIE.

We are the world,
We are ROOTS children.
We are the NODES that make up all the TREES so lets start building.

There are many ways to traverse,
But most are recursive,
Just type in ROOT ARROW LEFT, ROOT ARROW RIGHT.

You see we rule, 
Implementing us is great,
We'll have your programs doing real hard things very quickly.

We are taking CPS by storm,
Like rag weeds did to your lawn,
When all programers start to use us the world will be free.