Probably yes. I figure that trees come up so often that tree traversal on its own would be #1.

I did add topological sort to the list after remembering just how many times (and for different domains!) I've had to implement one, but other graph traversal algorithms like BFS/DFS are quite useful too.