> Off the top of my head, possible problems here might be:

> 1. To handle trees easily you have to understand recursion.

Well that's the point of the exercises I suggest - to learn recursion :-/

> No Big-O notation. Interviewers usually ask questions about time/space complexity

Well, that's the other half of the interview, I only promised that my method will cover half the questions :-)