Hmm ... binary trees.... I started the pseudocode with a linked list in my mind, so I basically made all of my traversals linear (e.g. point A straight through to point Z in a single for loop).
Now that I think about it though, a lot of the code requires searching for an entry, so that would def be the best way to go about it.
The problem is that I've never coded a binary tree before in any context. I'm completely confident in the structure and how the pointers operate, I've just never actually coded a whole program from start to finish via a binary tree.
Perhaps that's an option I'll definitely consider though.

If I can piece together some pseudocode I'll do it that way. If I find myself getting stuck, I'll resort to the linked list for the time being (until I could come up with a better option).
Another question: straight C has no support for classes, right? Only structs? (not sure of this one, just askin')
thanks!
- Dani