You can relearn BFS and DFS in a single night.
Steven Helferich

I’m pretty sure I could remember it on the spot in an interview. Its not hard. The point is, ANYTHING out of that book is fair game, because it is all covered in a CS algorithms course. Instead of DFS or BFS, they’ll ask red-black trees, and that I don’t remember. So I need a book, or google :].

One clap, two clap, three clap, forty?

By clapping more or less, you can signal to us which stories really stand out.